./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.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 3a05c4cd155494b334138871edc7853c0d0fcd1ccd2ec892619f7fa2811e9969 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:16:23,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:16:23,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:16:23,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:16:23,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:16:23,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:16:23,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:16:23,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:16:23,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:16:23,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:16:23,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:16:23,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:16:23,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:16:23,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:16:23,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:16:23,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:16:23,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:16:23,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:16:23,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:16:23,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:16:23,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:16:23,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:16:23,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:16:23,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:16:23,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:16:23,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:16:23,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:16:23,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:16:23,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:16:23,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:16:23,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:16:23,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:16:23,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:16:23,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:16:23,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:16:23,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:16:23,467 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 -> 3a05c4cd155494b334138871edc7853c0d0fcd1ccd2ec892619f7fa2811e9969 [2024-11-22 10:16:23,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:16:23,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:16:23,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:16:23,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:16:23,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:16:23,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i [2024-11-22 10:16:25,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:16:25,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:16:25,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-26.i [2024-11-22 10:16:25,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064d1a4eb/d797dedb6d5a4833804ff920dd7efc2f/FLAG6e23d5e48 [2024-11-22 10:16:25,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064d1a4eb/d797dedb6d5a4833804ff920dd7efc2f [2024-11-22 10:16:25,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:16:25,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:16:25,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:16:25,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:16:25,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:16:25,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@868cf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25, skipping insertion in model container [2024-11-22 10:16:25,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:16:25,637 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_100-1loop_file-26.i[916,929] [2024-11-22 10:16:25,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:16:25,741 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:16:25,753 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_100-1loop_file-26.i[916,929] [2024-11-22 10:16:25,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:16:25,851 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:16:25,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25 WrapperNode [2024-11-22 10:16:25,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:16:25,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:16:25,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:16:25,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:16:25,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,943 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-22 10:16:25,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:16:25,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:16:25,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:16:25,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:16:25,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,985 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-22 10:16:25,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:25,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:26,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:26,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:26,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:16:26,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:16:26,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:16:26,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:16:26,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (1/1) ... [2024-11-22 10:16:26,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:16:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:16:26,060 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-22 10:16:26,066 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-22 10:16:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:16:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:16:26,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:16:26,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:16:26,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:16:26,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:16:26,203 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:16:26,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:16:26,583 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-22 10:16:26,583 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:16:26,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:16:26,596 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:16:26,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:16:26 BoogieIcfgContainer [2024-11-22 10:16:26,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:16:26,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:16:26,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:16:26,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:16:26,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:16:25" (1/3) ... [2024-11-22 10:16:26,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5c6368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:16:26, skipping insertion in model container [2024-11-22 10:16:26,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:16:25" (2/3) ... [2024-11-22 10:16:26,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5c6368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:16:26, skipping insertion in model container [2024-11-22 10:16:26,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:16:26" (3/3) ... [2024-11-22 10:16:26,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-26.i [2024-11-22 10:16:26,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:16:26,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:16:26,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:16:26,696 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;@71a397a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:16:26,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:16:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 10:16:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-22 10:16:26,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:26,719 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:26,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:26,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash 79029718, now seen corresponding path program 1 times [2024-11-22 10:16:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166317022] [2024-11-22 10:16:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2024-11-22 10:16:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166317022] [2024-11-22 10:16:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166317022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:16:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431597489] [2024-11-22 10:16:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:16:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:16:27,080 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-22 10:16:27,081 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-22 10:16:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:27,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:16:27,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:16:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2024-11-22 10:16:27,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:16:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431597489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:16:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:16:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595879891] [2024-11-22 10:16:27,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:27,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:16:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:16:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:16:27,316 INFO L87 Difference]: Start difference. First operand has 103 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:27,347 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2024-11-22 10:16:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:16:27,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197 [2024-11-22 10:16:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:27,356 INFO L225 Difference]: With dead ends: 203 [2024-11-22 10:16:27,357 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 10:16:27,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-22 10:16:27,364 INFO L432 NwaCegarLoop]: 157 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, 157 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-22 10:16:27,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:16:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 10:16:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 10:16:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 10:16:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-22 10:16:27,398 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 197 [2024-11-22 10:16:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:27,398 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-22 10:16:27,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-22 10:16:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-22 10:16:27,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:27,402 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:27,410 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-22 10:16:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:16:27,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 459054034, now seen corresponding path program 1 times [2024-11-22 10:16:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399383376] [2024-11-22 10:16:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399383376] [2024-11-22 10:16:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399383376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:16:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006387022] [2024-11-22 10:16:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:16:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:16:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:16:28,189 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:28,246 INFO L93 Difference]: Finished difference Result 291 states and 453 transitions. [2024-11-22 10:16:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:16:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-22 10:16:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:28,251 INFO L225 Difference]: With dead ends: 291 [2024-11-22 10:16:28,252 INFO L226 Difference]: Without dead ends: 195 [2024-11-22 10:16:28,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:16:28,255 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 147 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:28,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 401 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:16:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-22 10:16:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 100. [2024-11-22 10:16:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 10:16:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2024-11-22 10:16:28,281 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 197 [2024-11-22 10:16:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:28,282 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2024-11-22 10:16:28,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2024-11-22 10:16:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-22 10:16:28,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:28,288 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:28,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:16:28,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:28,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -562014320, now seen corresponding path program 1 times [2024-11-22 10:16:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:28,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586813438] [2024-11-22 10:16:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586813438] [2024-11-22 10:16:29,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586813438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:29,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:16:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41857496] [2024-11-22 10:16:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:16:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:16:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:16:29,264 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:29,440 INFO L93 Difference]: Finished difference Result 305 states and 463 transitions. [2024-11-22 10:16:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:16:29,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-22 10:16:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:29,446 INFO L225 Difference]: With dead ends: 305 [2024-11-22 10:16:29,449 INFO L226 Difference]: Without dead ends: 208 [2024-11-22 10:16:29,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:16:29,451 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 132 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:29,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 529 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:16:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-22 10:16:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2024-11-22 10:16:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 137 states have internal predecessors, (197), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:16:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 269 transitions. [2024-11-22 10:16:29,484 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 269 transitions. Word has length 197 [2024-11-22 10:16:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:29,485 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 269 transitions. [2024-11-22 10:16:29,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 269 transitions. [2024-11-22 10:16:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-22 10:16:29,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:29,493 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:29,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:16:29,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1297771836, now seen corresponding path program 1 times [2024-11-22 10:16:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580947094] [2024-11-22 10:16:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580947094] [2024-11-22 10:16:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580947094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:16:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678187851] [2024-11-22 10:16:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:16:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:16:29,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:16:29,838 INFO L87 Difference]: Start difference. First operand 175 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:30,037 INFO L93 Difference]: Finished difference Result 569 states and 872 transitions. [2024-11-22 10:16:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:16:30,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-22 10:16:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:30,042 INFO L225 Difference]: With dead ends: 569 [2024-11-22 10:16:30,043 INFO L226 Difference]: Without dead ends: 397 [2024-11-22 10:16:30,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:16:30,045 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 159 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:30,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 592 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:16:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-22 10:16:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 325. [2024-11-22 10:16:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 248 states have (on average 1.439516129032258) internal successors, (357), 250 states have internal predecessors, (357), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:16:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 501 transitions. [2024-11-22 10:16:30,086 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 501 transitions. Word has length 198 [2024-11-22 10:16:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 501 transitions. [2024-11-22 10:16:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-22 10:16:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 501 transitions. [2024-11-22 10:16:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-22 10:16:30,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:30,089 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:30,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:16:30,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:30,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1157223226, now seen corresponding path program 1 times [2024-11-22 10:16:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673018981] [2024-11-22 10:16:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:30,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673018981] [2024-11-22 10:16:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673018981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:16:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382796730] [2024-11-22 10:16:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:16:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:30,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:16:30,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:16:30,394 INFO L87 Difference]: Start difference. First operand 325 states and 501 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:30,625 INFO L93 Difference]: Finished difference Result 819 states and 1265 transitions. [2024-11-22 10:16:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:16:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-22 10:16:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:30,628 INFO L225 Difference]: With dead ends: 819 [2024-11-22 10:16:30,629 INFO L226 Difference]: Without dead ends: 497 [2024-11-22 10:16:30,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:16:30,630 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 117 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:30,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 599 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:16:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-22 10:16:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2024-11-22 10:16:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 380 states have (on average 1.4342105263157894) internal successors, (545), 383 states have internal predecessors, (545), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-22 10:16:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 761 transitions. [2024-11-22 10:16:30,663 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 761 transitions. Word has length 198 [2024-11-22 10:16:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 761 transitions. [2024-11-22 10:16:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 761 transitions. [2024-11-22 10:16:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-22 10:16:30,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:30,666 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:30,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:16:30,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:30,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1974871676, now seen corresponding path program 1 times [2024-11-22 10:16:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:30,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818269142] [2024-11-22 10:16:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818269142] [2024-11-22 10:16:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818269142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:31,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:16:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236334104] [2024-11-22 10:16:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:31,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:16:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:16:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:16:31,435 INFO L87 Difference]: Start difference. First operand 495 states and 761 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:32,343 INFO L93 Difference]: Finished difference Result 1647 states and 2525 transitions. [2024-11-22 10:16:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:16:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-22 10:16:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:32,350 INFO L225 Difference]: With dead ends: 1647 [2024-11-22 10:16:32,351 INFO L226 Difference]: Without dead ends: 1155 [2024-11-22 10:16:32,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:16:32,353 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 432 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:32,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1013 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 10:16:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-22 10:16:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1135. [2024-11-22 10:16:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 868 states have (on average 1.4251152073732718) internal successors, (1237), 875 states have internal predecessors, (1237), 252 states have call successors, (252), 14 states have call predecessors, (252), 14 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-22 10:16:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1741 transitions. [2024-11-22 10:16:32,482 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1741 transitions. Word has length 198 [2024-11-22 10:16:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:32,482 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1741 transitions. [2024-11-22 10:16:32,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-22 10:16:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1741 transitions. [2024-11-22 10:16:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-22 10:16:32,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:32,485 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:16:32,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:32,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1510748994, now seen corresponding path program 1 times [2024-11-22 10:16:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125170250] [2024-11-22 10:16:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:16:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-22 10:16:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:16:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125170250] [2024-11-22 10:16:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125170250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:16:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:16:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 10:16:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090092468] [2024-11-22 10:16:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:16:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:16:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:16:45,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:16:45,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:16:45,329 INFO L87 Difference]: Start difference. First operand 1135 states and 1741 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-22 10:16:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:16:47,904 INFO L93 Difference]: Finished difference Result 3048 states and 4574 transitions. [2024-11-22 10:16:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:16:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 198 [2024-11-22 10:16:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:16:47,923 INFO L225 Difference]: With dead ends: 3048 [2024-11-22 10:16:47,923 INFO L226 Difference]: Without dead ends: 1916 [2024-11-22 10:16:47,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2024-11-22 10:16:47,928 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 804 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:16:47,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1057 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 10:16:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-22 10:16:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1363. [2024-11-22 10:16:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1078 states have (on average 1.422077922077922) internal successors, (1533), 1086 states have internal predecessors, (1533), 254 states have call successors, (254), 30 states have call predecessors, (254), 30 states have return successors, (254), 246 states have call predecessors, (254), 254 states have call successors, (254) [2024-11-22 10:16:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2041 transitions. [2024-11-22 10:16:48,036 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2041 transitions. Word has length 198 [2024-11-22 10:16:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:16:48,037 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2041 transitions. [2024-11-22 10:16:48,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-22 10:16:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2041 transitions. [2024-11-22 10:16:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-22 10:16:48,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:16:48,041 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:16:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 10:16:48,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:16:48,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:16:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 923942980, now seen corresponding path program 1 times [2024-11-22 10:16:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:16:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36821630] [2024-11-22 10:16:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:16:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:16:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat