./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-59.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-1loop_file-59.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 fa05e78fe0e0f33a03e9219e44c3e741a6c5e7a079383cf31cbd90724515faa0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:48:37,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:48:37,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:48:37,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:48:37,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:48:37,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:48:37,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:48:37,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:48:37,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:48:37,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:48:37,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:48:37,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:48:37,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:48:37,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:48:37,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:48:37,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:48:37,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:48:37,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:48:37,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:48:37,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:48:37,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:48:37,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:48:37,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:48:37,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:48:37,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:48:37,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:48:37,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:48:37,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:48:37,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:48:37,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:48:37,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:48:37,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:48:37,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:37,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:48:37,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:48:37,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:48:37,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:48:37,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:48:37,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:48:37,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:48:37,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:48:37,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:48:37,810 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 -> fa05e78fe0e0f33a03e9219e44c3e741a6c5e7a079383cf31cbd90724515faa0 [2024-11-10 07:48:38,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:48:38,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:48:38,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:48:38,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:48:38,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:48:38,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-59.i [2024-11-10 07:48:39,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:48:39,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:48:39,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-59.i [2024-11-10 07:48:39,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fbf88d9/7b52e2af0b1f43a9b7e6db70c2c7627d/FLAG126cce4f6 [2024-11-10 07:48:40,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fbf88d9/7b52e2af0b1f43a9b7e6db70c2c7627d [2024-11-10 07:48:40,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:48:40,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:48:40,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:40,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:48:40,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:48:40,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b73d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40, skipping insertion in model container [2024-11-10 07:48:40,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:48:40,481 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-1loop_file-59.i[915,928] [2024-11-10 07:48:40,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:40,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:48:40,603 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-1loop_file-59.i[915,928] [2024-11-10 07:48:40,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:40,659 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:48:40,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40 WrapperNode [2024-11-10 07:48:40,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:40,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:40,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:48:40,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:48:40,668 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:48:40" (1/1) ... [2024-11-10 07:48:40,682 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:48:40" (1/1) ... [2024-11-10 07:48:40,721 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-10 07:48:40,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:40,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:48:40,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:48:40,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:48:40,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,761 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:48:40,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:48:40,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:48:40,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:48:40,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:48:40,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (1/1) ... [2024-11-10 07:48:40,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:40,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:40,838 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:48:40,840 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:48:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:48:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:48:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:48:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:48:40,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:48:40,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:48:40,962 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:48:40,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:48:41,299 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 07:48:41,299 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:48:41,317 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:48:41,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:48:41,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:41 BoogieIcfgContainer [2024-11-10 07:48:41,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:48:41,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:48:41,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:48:41,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:48:41,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:48:40" (1/3) ... [2024-11-10 07:48:41,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad1802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:41, skipping insertion in model container [2024-11-10 07:48:41,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:40" (2/3) ... [2024-11-10 07:48:41,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad1802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:41, skipping insertion in model container [2024-11-10 07:48:41,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:41" (3/3) ... [2024-11-10 07:48:41,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-59.i [2024-11-10 07:48:41,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:48:41,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:48:41,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:48:41,428 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;@3da996db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:48:41,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:48:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 07:48:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:48:41,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:41,448 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 743751383, now seen corresponding path program 1 times [2024-11-10 07:48:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244851291] [2024-11-10 07:48:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:48:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:48:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:48:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:48:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:48:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:48:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:48:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:48:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:48:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:48:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:48:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:48:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:48:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:48:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244851291] [2024-11-10 07:48:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244851291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:41,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:48:41,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749802033] [2024-11-10 07:48:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:41,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:48:41,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:48:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:48:41,944 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:48:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:41,967 INFO L93 Difference]: Finished difference Result 110 states and 176 transitions. [2024-11-10 07:48:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:48:41,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-10 07:48:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:41,975 INFO L225 Difference]: With dead ends: 110 [2024-11-10 07:48:41,976 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 07:48:41,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:48:41,986 INFO L432 NwaCegarLoop]: 79 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, 79 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:48:41,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:48:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 07:48:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 07:48:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 07:48:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-10 07:48:42,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 97 [2024-11-10 07:48:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:42,035 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-10 07:48:42,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:48:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-10 07:48:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 07:48:42,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:42,042 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:48:42,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1859539963, now seen corresponding path program 1 times [2024-11-10 07:48:42,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399627611] [2024-11-10 07:48:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:48:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:48:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:48:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:48:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:48:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:48:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:48:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:48:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:48:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:48:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:48:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:48:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:48:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:48:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399627611] [2024-11-10 07:48:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399627611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:48:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463692777] [2024-11-10 07:48:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:48:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:48:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:48:42,635 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:48:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:42,804 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2024-11-10 07:48:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:48:42,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-10 07:48:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:42,809 INFO L225 Difference]: With dead ends: 152 [2024-11-10 07:48:42,809 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 07:48:42,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:48:42,812 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:48:42,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:48:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 07:48:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2024-11-10 07:48:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:48:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-10 07:48:42,839 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 97 [2024-11-10 07:48:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:42,840 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-10 07:48:42,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 07:48:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-10 07:48:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:48:42,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:42,846 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:48:42,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:42,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1659627081, now seen corresponding path program 1 times [2024-11-10 07:48:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:42,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24680493] [2024-11-10 07:48:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:42,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:48:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:48:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:48:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:48:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:48:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:48:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:48:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:48:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:48:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:48:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:48:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:48:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:48:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 07:48:43,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:43,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24680493] [2024-11-10 07:48:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24680493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:43,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:43,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:48:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802218446] [2024-11-10 07:48:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:43,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:48:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:48:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:48:43,572 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:48:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:43,938 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2024-11-10 07:48:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:48:43,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-10 07:48:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:43,941 INFO L225 Difference]: With dead ends: 192 [2024-11-10 07:48:43,941 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 07:48:43,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:48:43,943 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 127 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:48:43,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:48:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 07:48:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-11-10 07:48:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 07:48:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-10 07:48:43,966 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2024-11-10 07:48:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:43,967 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-10 07:48:43,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 07:48:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-10 07:48:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:48:43,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:43,969 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:48:43,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:43,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -165108322, now seen corresponding path program 1 times [2024-11-10 07:48:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577589414] [2024-11-10 07:48:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:48:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:48:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:48:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:48:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:48:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:48:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:48:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:48:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:48:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:48:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:48:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:48:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:48:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 07:48:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577589414] [2024-11-10 07:48:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577589414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:48:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40042433] [2024-11-10 07:48:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:44,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:48:44,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:44,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:48:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:48:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:44,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:48:44,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:48:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 07:48:44,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:48:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 07:48:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40042433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:48:44,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:48:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2024-11-10 07:48:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868186078] [2024-11-10 07:48:44,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:48:44,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:48:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:48:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:48:44,927 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:48:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:45,439 INFO L93 Difference]: Finished difference Result 386 states and 540 transitions. [2024-11-10 07:48:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 07:48:45,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2024-11-10 07:48:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:45,443 INFO L225 Difference]: With dead ends: 386 [2024-11-10 07:48:45,443 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 07:48:45,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-11-10 07:48:45,448 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 177 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:48:45,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 247 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:48:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 07:48:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 228. [2024-11-10 07:48:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 154 states have internal predecessors, (181), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 07:48:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2024-11-10 07:48:45,514 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 99 [2024-11-10 07:48:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:48:45,516 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2024-11-10 07:48:45,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:48:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2024-11-10 07:48:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:48:45,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:45,519 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:48:45,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:48:45,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:45,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1577702013, now seen corresponding path program 1 times [2024-11-10 07:48:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:45,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381514568] [2024-11-10 07:48:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:48:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219662254] [2024-11-10 07:48:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:45,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:48:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:45,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:48:45,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:48:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:46,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 07:48:46,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:48:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 133 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-10 07:48:47,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:48:59,156 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 07:49:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381514568] [2024-11-10 07:49:25,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:49:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219662254] [2024-11-10 07:49:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219662254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:49:25,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:49:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-10 07:49:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729721721] [2024-11-10 07:49:25,607 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:49:25,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:49:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:49:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-10 07:49:25,609 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 07:49:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:26,318 INFO L93 Difference]: Finished difference Result 466 states and 615 transitions. [2024-11-10 07:49:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 07:49:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 99 [2024-11-10 07:49:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:26,323 INFO L225 Difference]: With dead ends: 466 [2024-11-10 07:49:26,323 INFO L226 Difference]: Without dead ends: 279 [2024-11-10 07:49:26,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-10 07:49:26,325 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:26,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 372 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:49:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-10 07:49:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 264. [2024-11-10 07:49:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 179 states have (on average 1.1508379888268156) internal successors, (206), 181 states have internal predecessors, (206), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 07:49:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 338 transitions. [2024-11-10 07:49:26,373 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 338 transitions. Word has length 99 [2024-11-10 07:49:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 338 transitions. [2024-11-10 07:49:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 07:49:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 338 transitions. [2024-11-10 07:49:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 07:49:26,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:26,376 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:49:26,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:49:26,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:26,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 128294685, now seen corresponding path program 1 times [2024-11-10 07:49:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544856143] [2024-11-10 07:49:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:49:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936942344] [2024-11-10 07:49:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:26,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:49:26,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:49:26,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:49:26,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:49:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:27,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 07:49:27,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 07:49:28,357 INFO L311 TraceCheckSpWp]: Computing backward predicates...