./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-44.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_25-while_file-44.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 52bbdb7a41796c9d1c42151e2a189c74de125cfeae86983365ab22d3ff48a0ac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:35:50,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:35:50,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:35:50,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:35:50,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:35:50,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:35:50,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:35:50,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:35:50,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:35:50,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:35:50,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:35:50,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:35:50,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:35:50,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:35:50,658 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:35:50,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:35:50,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:35:50,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:35:50,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:35:50,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:35:50,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:35:50,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:35:50,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:35:50,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:35:50,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:35:50,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:35:50,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:35:50,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:35:50,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:35:50,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:35:50,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:35:50,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:35:50,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:50,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:35:50,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:35:50,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:35:50,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:35:50,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:35:50,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:35:50,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:35:50,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:35:50,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:35:50,668 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 -> 52bbdb7a41796c9d1c42151e2a189c74de125cfeae86983365ab22d3ff48a0ac [2024-11-10 07:35:50,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:35:50,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:35:50,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:35:50,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:35:50,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:35:50,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-44.i [2024-11-10 07:35:52,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:35:52,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:35:52,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-44.i [2024-11-10 07:35:52,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1e1da18/b798ea9b1560430eb7de37a94fb05dff/FLAG1f9cfed79 [2024-11-10 07:35:52,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1e1da18/b798ea9b1560430eb7de37a94fb05dff [2024-11-10 07:35:52,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:35:52,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:35:52,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:52,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:35:52,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:35:52,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:52" (1/1) ... [2024-11-10 07:35:52,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152d407c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:52, skipping insertion in model container [2024-11-10 07:35:52,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:52" (1/1) ... [2024-11-10 07:35:53,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:35:53,227 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-44.i[915,928] [2024-11-10 07:35:53,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:53,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:35:53,340 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-44.i[915,928] [2024-11-10 07:35:53,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:53,387 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:35:53,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53 WrapperNode [2024-11-10 07:35:53,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:53,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:53,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:35:53,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:35:53,396 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:35:53" (1/1) ... [2024-11-10 07:35:53,403 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:35:53" (1/1) ... [2024-11-10 07:35:53,439 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-10 07:35:53,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:53,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:35:53,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:35:53,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:35:53,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,481 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:35:53,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:35:53,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:35:53,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:35:53,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:35:53,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (1/1) ... [2024-11-10 07:35:53,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:35:53,549 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:35:53,553 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:35:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:35:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:35:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:35:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:35:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:35:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:35:53,686 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:35:53,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:35:53,996 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2024-11-10 07:35:54,028 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 07:35:54,030 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:35:54,048 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:35:54,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:35:54,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:54 BoogieIcfgContainer [2024-11-10 07:35:54,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:35:54,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:35:54,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:35:54,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:35:54,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:35:52" (1/3) ... [2024-11-10 07:35:54,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b2f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:54, skipping insertion in model container [2024-11-10 07:35:54,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:53" (2/3) ... [2024-11-10 07:35:54,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b2f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:54, skipping insertion in model container [2024-11-10 07:35:54,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:54" (3/3) ... [2024-11-10 07:35:54,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-44.i [2024-11-10 07:35:54,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:35:54,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:35:54,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:35:54,141 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;@12f7c0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:35:54,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:35:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 07:35:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 07:35:54,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:54,158 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1831929700, now seen corresponding path program 1 times [2024-11-10 07:35:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510752875] [2024-11-10 07:35:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:36:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:36:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:36:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:36:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:36:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:36:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:36:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:36:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:36:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:36:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:36:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:36:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:36:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:36:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:36:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:36:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:36:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:36:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:36:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:36:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:36:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 07:36:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:36:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510752875] [2024-11-10 07:36:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510752875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:36:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:36:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:36:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325145965] [2024-11-10 07:36:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:36:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:36:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:36:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:36:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:36:02,689 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:36:04,050 INFO L93 Difference]: Finished difference Result 196 states and 324 transitions. [2024-11-10 07:36:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:36:04,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2024-11-10 07:36:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:36:04,064 INFO L225 Difference]: With dead ends: 196 [2024-11-10 07:36:04,064 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 07:36:04,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:36:04,074 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 123 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:36:04,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 527 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 07:36:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 07:36:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 85. [2024-11-10 07:36:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:36:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-10 07:36:04,134 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 134 [2024-11-10 07:36:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:36:04,135 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-10 07:36:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-10 07:36:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 07:36:04,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:36:04,139 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:36:04,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:36:04,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:36:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1538526693, now seen corresponding path program 1 times [2024-11-10 07:36:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:36:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791419931] [2024-11-10 07:36:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:36:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:36:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:36:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:36:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:36:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:36:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:36:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:36:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:36:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:36:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:36:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:36:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:36:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:36:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:36:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:36:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:36:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:36:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:36:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:36:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:36:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:36:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:36:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 07:36:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:36:05,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791419931] [2024-11-10 07:36:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791419931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:36:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:36:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:36:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550192706] [2024-11-10 07:36:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:36:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:36:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:36:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:36:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:36:05,056 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:36:05,745 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2024-11-10 07:36:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:36:05,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2024-11-10 07:36:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:36:05,748 INFO L225 Difference]: With dead ends: 209 [2024-11-10 07:36:05,748 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 07:36:05,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:36:05,750 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 111 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:36:05,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 814 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:36:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 07:36:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2024-11-10 07:36:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:36:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-11-10 07:36:05,776 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 134 [2024-11-10 07:36:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:36:05,778 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-11-10 07:36:05,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-11-10 07:36:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 07:36:05,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:36:05,781 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:36:05,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:36:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:36:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1508584513, now seen corresponding path program 1 times [2024-11-10 07:36:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:36:05,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750032969] [2024-11-10 07:36:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:36:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:36:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:36:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:36:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:36:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:36:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:36:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:36:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:36:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:36:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:36:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:36:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:36:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:36:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:36:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:36:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:36:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:36:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:36:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:36:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:36:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:36:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:36:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:36:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 07:36:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:36:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750032969] [2024-11-10 07:36:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750032969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:36:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:36:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:36:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004265181] [2024-11-10 07:36:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:36:11,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:36:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:36:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:36:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:36:11,967 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:36:13,131 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2024-11-10 07:36:13,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:36:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-10 07:36:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:36:13,134 INFO L225 Difference]: With dead ends: 213 [2024-11-10 07:36:13,134 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 07:36:13,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:36:13,137 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 140 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:36:13,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 445 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:36:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 07:36:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 86. [2024-11-10 07:36:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:36:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-11-10 07:36:13,161 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 135 [2024-11-10 07:36:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:36:13,161 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-11-10 07:36:13,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 07:36:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-11-10 07:36:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 07:36:13,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:36:13,167 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:36:13,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:36:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:36:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -288366846, now seen corresponding path program 1 times [2024-11-10 07:36:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:36:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474517811] [2024-11-10 07:36:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:36:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:36:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat