./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_fillercode_fillercodestructure_filler-pe-co_file-50.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 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:35:09,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:35:09,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:35:09,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:35:09,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:35:09,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:35:09,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:35:09,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:35:09,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:35:09,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:35:09,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:35:09,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:35:09,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:35:09,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:35:09,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:35:09,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:35:09,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:35:09,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:35:09,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:35:09,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:35:09,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:35:09,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:35:09,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:35:09,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:35:09,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:35:09,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:35:09,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:35:09,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:35:09,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:35:09,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:35:09,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:35:09,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:35:09,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:35:09,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:35:09,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:35:09,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:35:09,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:35:09,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:35:09,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:35:09,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:35:09,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:35:09,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:35:09,800 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 -> 1d54cda1e1849769fc331dfdba9fcfb2e9b4fcf52bd0d43d6f8a699ed6598582 [2024-11-18 20:35:10,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:35:10,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:35:10,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:35:10,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:35:10,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:35:10,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2024-11-18 20:35:11,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:35:11,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:35:11,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2024-11-18 20:35:11,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb75933e/6b551fe180ce48989662bc909ddbd225/FLAGda3f165a3 [2024-11-18 20:35:11,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb75933e/6b551fe180ce48989662bc909ddbd225 [2024-11-18 20:35:11,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:35:11,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:35:11,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:35:11,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:35:11,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:35:11,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:11" (1/1) ... [2024-11-18 20:35:11,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fae9a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:11, skipping insertion in model container [2024-11-18 20:35:11,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:11" (1/1) ... [2024-11-18 20:35:11,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:35:12,013 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_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2024-11-18 20:35:12,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:35:12,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:35:12,118 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_fillercode_fillercodestructure_filler-pe-co_file-50.i[919,932] [2024-11-18 20:35:12,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:35:12,239 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:35:12,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12 WrapperNode [2024-11-18 20:35:12,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:35:12,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:35:12,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:35:12,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:35:12,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,308 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-11-18 20:35:12,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:35:12,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:35:12,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:35:12,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:35:12,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,343 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-18 20:35:12,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:35:12,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:35:12,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:35:12,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:35:12,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (1/1) ... [2024-11-18 20:35:12,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:35:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:35:12,420 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-18 20:35:12,427 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-18 20:35:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:35:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:35:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:35:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:35:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:35:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:35:12,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:35:12,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:35:13,045 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-18 20:35:13,046 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:35:13,059 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:35:13,060 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:35:13,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:13 BoogieIcfgContainer [2024-11-18 20:35:13,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:35:13,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:35:13,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:35:13,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:35:13,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:35:11" (1/3) ... [2024-11-18 20:35:13,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd10b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:13, skipping insertion in model container [2024-11-18 20:35:13,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:12" (2/3) ... [2024-11-18 20:35:13,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd10b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:13, skipping insertion in model container [2024-11-18 20:35:13,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:13" (3/3) ... [2024-11-18 20:35:13,072 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-50.i [2024-11-18 20:35:13,089 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:35:13,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:35:13,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:35:13,172 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;@1f67ed3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:35:13,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:35:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 71 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-18 20:35:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-18 20:35:13,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:13,199 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:13,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1482600106, now seen corresponding path program 1 times [2024-11-18 20:35:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801473817] [2024-11-18 20:35:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-18 20:35:13,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801473817] [2024-11-18 20:35:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801473817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:35:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:35:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:35:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574064011] [2024-11-18 20:35:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:35:13,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:35:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:35:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:35:13,893 INFO L87 Difference]: Start difference. First operand has 108 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 71 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:14,010 INFO L93 Difference]: Finished difference Result 307 states and 555 transitions. [2024-11-18 20:35:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:35:14,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-18 20:35:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:14,022 INFO L225 Difference]: With dead ends: 307 [2024-11-18 20:35:14,022 INFO L226 Difference]: Without dead ends: 202 [2024-11-18 20:35:14,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 20:35:14,029 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 145 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:35:14,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 301 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:35:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-18 20:35:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 113. [2024-11-18 20:35:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-18 20:35:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2024-11-18 20:35:14,097 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 226 [2024-11-18 20:35:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:14,099 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2024-11-18 20:35:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2024-11-18 20:35:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-18 20:35:14,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:14,104 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:14,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 20:35:14,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:14,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1801249940, now seen corresponding path program 1 times [2024-11-18 20:35:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590896369] [2024-11-18 20:35:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-18 20:35:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590896369] [2024-11-18 20:35:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590896369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:35:14,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:35:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:35:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473310611] [2024-11-18 20:35:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:35:14,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:35:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:35:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:35:14,297 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:14,333 INFO L93 Difference]: Finished difference Result 224 states and 343 transitions. [2024-11-18 20:35:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:35:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-18 20:35:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:14,337 INFO L225 Difference]: With dead ends: 224 [2024-11-18 20:35:14,337 INFO L226 Difference]: Without dead ends: 114 [2024-11-18 20:35:14,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 20:35:14,342 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 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-18 20:35:14,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:35:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-18 20:35:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-18 20:35:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-18 20:35:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2024-11-18 20:35:14,362 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 226 [2024-11-18 20:35:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:14,363 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2024-11-18 20:35:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2024-11-18 20:35:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 20:35:14,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:14,367 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:35:14,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -229539827, now seen corresponding path program 1 times [2024-11-18 20:35:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882363948] [2024-11-18 20:35:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-18 20:35:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882363948] [2024-11-18 20:35:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882363948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:35:14,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:35:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:35:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121603769] [2024-11-18 20:35:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:35:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:35:14,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:14,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:35:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:35:14,745 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:15,026 INFO L93 Difference]: Finished difference Result 315 states and 480 transitions. [2024-11-18 20:35:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:35:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2024-11-18 20:35:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:15,031 INFO L225 Difference]: With dead ends: 315 [2024-11-18 20:35:15,031 INFO L226 Difference]: Without dead ends: 204 [2024-11-18 20:35:15,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:35:15,033 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 149 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:35:15,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 355 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:35:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-18 20:35:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2024-11-18 20:35:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-18 20:35:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-11-18 20:35:15,060 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 227 [2024-11-18 20:35:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-11-18 20:35:15,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-11-18 20:35:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 20:35:15,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:15,065 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:35:15,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1918483569, now seen corresponding path program 1 times [2024-11-18 20:35:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7511171] [2024-11-18 20:35:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 21 proven. 81 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-18 20:35:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7511171] [2024-11-18 20:35:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7511171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:35:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617319961] [2024-11-18 20:35:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:35:16,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:35:16,165 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-18 20:35:16,167 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-18 20:35:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:16,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 20:35:16,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:35:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1305 proven. 93 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-18 20:35:17,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:35:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 105 proven. 96 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-11-18 20:35:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617319961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:35:18,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:35:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 23 [2024-11-18 20:35:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900207521] [2024-11-18 20:35:18,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:35:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 20:35:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 20:35:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-18 20:35:18,042 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 23 states, 22 states have (on average 5.363636363636363) internal successors, (118), 23 states have internal predecessors, (118), 7 states have call successors, (80), 3 states have call predecessors, (80), 7 states have return successors, (81), 6 states have call predecessors, (81), 7 states have call successors, (81) [2024-11-18 20:35:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:20,835 INFO L93 Difference]: Finished difference Result 415 states and 593 transitions. [2024-11-18 20:35:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-18 20:35:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.363636363636363) internal successors, (118), 23 states have internal predecessors, (118), 7 states have call successors, (80), 3 states have call predecessors, (80), 7 states have return successors, (81), 6 states have call predecessors, (81), 7 states have call successors, (81) Word has length 227 [2024-11-18 20:35:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:20,843 INFO L225 Difference]: With dead ends: 415 [2024-11-18 20:35:20,843 INFO L226 Difference]: Without dead ends: 304 [2024-11-18 20:35:20,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1104, Invalid=3866, Unknown=0, NotChecked=0, Total=4970 [2024-11-18 20:35:20,850 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 790 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 20:35:20,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1090 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 20:35:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-18 20:35:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 272. [2024-11-18 20:35:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 174 states have (on average 1.2298850574712643) internal successors, (214), 176 states have internal predecessors, (214), 86 states have call successors, (86), 11 states have call predecessors, (86), 11 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-18 20:35:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 386 transitions. [2024-11-18 20:35:20,914 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 386 transitions. Word has length 227 [2024-11-18 20:35:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 386 transitions. [2024-11-18 20:35:20,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.363636363636363) internal successors, (118), 23 states have internal predecessors, (118), 7 states have call successors, (80), 3 states have call predecessors, (80), 7 states have return successors, (81), 6 states have call predecessors, (81), 7 states have call successors, (81) [2024-11-18 20:35:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 386 transitions. [2024-11-18 20:35:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 20:35:20,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:20,920 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:20,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 20:35:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:35:21,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1177816309, now seen corresponding path program 1 times [2024-11-18 20:35:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603870784] [2024-11-18 20:35:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-18 20:35:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603870784] [2024-11-18 20:35:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603870784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:35:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:35:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:35:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133954524] [2024-11-18 20:35:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:35:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:35:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:35:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:35:21,299 INFO L87 Difference]: Start difference. First operand 272 states and 386 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:21,374 INFO L93 Difference]: Finished difference Result 708 states and 1008 transitions. [2024-11-18 20:35:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:35:21,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2024-11-18 20:35:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:21,380 INFO L225 Difference]: With dead ends: 708 [2024-11-18 20:35:21,381 INFO L226 Difference]: Without dead ends: 473 [2024-11-18 20:35:21,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:35:21,383 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 128 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:35:21,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 666 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:35:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-18 20:35:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 298. [2024-11-18 20:35:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 200 states have (on average 1.27) internal successors, (254), 202 states have internal predecessors, (254), 86 states have call successors, (86), 11 states have call predecessors, (86), 11 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-18 20:35:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 426 transitions. [2024-11-18 20:35:21,429 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 426 transitions. Word has length 227 [2024-11-18 20:35:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:21,430 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 426 transitions. [2024-11-18 20:35:21,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 426 transitions. [2024-11-18 20:35:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 20:35:21,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:21,433 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:21,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:35:21,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1837287309, now seen corresponding path program 1 times [2024-11-18 20:35:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384080666] [2024-11-18 20:35:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-18 20:35:21,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:21,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384080666] [2024-11-18 20:35:21,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384080666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:35:21,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:35:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:35:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128073583] [2024-11-18 20:35:21,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:35:21,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:35:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:21,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:35:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:35:21,633 INFO L87 Difference]: Start difference. First operand 298 states and 426 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:35:21,815 INFO L93 Difference]: Finished difference Result 559 states and 801 transitions. [2024-11-18 20:35:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:35:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 227 [2024-11-18 20:35:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:35:21,821 INFO L225 Difference]: With dead ends: 559 [2024-11-18 20:35:21,821 INFO L226 Difference]: Without dead ends: 298 [2024-11-18 20:35:21,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:35:21,823 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 149 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:35:21,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 213 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:35:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-18 20:35:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-18 20:35:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 200 states have (on average 1.26) internal successors, (252), 202 states have internal predecessors, (252), 86 states have call successors, (86), 11 states have call predecessors, (86), 11 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-18 20:35:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 424 transitions. [2024-11-18 20:35:21,864 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 424 transitions. Word has length 227 [2024-11-18 20:35:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:35:21,865 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 424 transitions. [2024-11-18 20:35:21,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-18 20:35:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 424 transitions. [2024-11-18 20:35:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-18 20:35:21,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:35:21,868 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:35:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:35:21,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:35:21,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:35:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 148343567, now seen corresponding path program 1 times [2024-11-18 20:35:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:35:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48366972] [2024-11-18 20:35:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:35:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 21 proven. 81 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-18 20:35:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:35:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48366972] [2024-11-18 20:35:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48366972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:35:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962223448] [2024-11-18 20:35:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:35:23,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:35:23,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:35:23,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:35:23,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 20:35:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:35:23,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-18 20:35:23,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:35:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1511 proven. 237 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2024-11-18 20:35:29,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:35:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 135 proven. 255 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2024-11-18 20:35:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962223448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:35:37,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:35:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 19] total 44 [2024-11-18 20:35:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53628938] [2024-11-18 20:35:37,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:35:37,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-18 20:35:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:35:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-18 20:35:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1524, Unknown=1, NotChecked=0, Total=1892 [2024-11-18 20:35:37,717 INFO L87 Difference]: Start difference. First operand 298 states and 424 transitions. Second operand has 44 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 42 states have internal predecessors, (150), 12 states have call successors, (90), 5 states have call predecessors, (90), 12 states have return successors, (91), 11 states have call predecessors, (91), 12 states have call successors, (91) [2024-11-18 20:35:52,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-18 20:35:56,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:01,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:05,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:14,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:34,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:39,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-18 20:36:43,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]