./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aacc76a5b8f972927524a85f8ea4b99cc049d27f5d90192cb961dbf1fd5d0c86 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:32:53,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:32:53,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:32:53,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:32:53,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:32:53,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:32:53,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:32:53,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:32:53,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:32:53,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:32:53,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:32:53,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:32:53,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:32:53,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:32:53,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:32:53,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:32:53,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:32:53,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:32:53,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:32:53,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:32:53,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:32:53,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:32:53,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:32:53,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:32:53,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:32:53,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:32:53,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:32:53,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:32:53,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:32:53,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:32:53,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:32:53,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:32:53,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:32:53,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:32:53,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:32:53,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:32:53,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:32:53,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:32:53,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:32:53,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:32:53,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:32:53,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:32:53,830 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-clean/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-clean/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 -> aacc76a5b8f972927524a85f8ea4b99cc049d27f5d90192cb961dbf1fd5d0c86 [2024-10-10 23:32:54,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:32:54,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:32:54,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:32:54,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:32:54,110 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:32:54,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c [2024-10-10 23:32:55,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:32:55,852 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:32:55,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c [2024-10-10 23:32:55,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c4210ddcb/5f18bfd6ad22446281a5e5fe8e2682a4/FLAGb819457d1 [2024-10-10 23:32:55,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c4210ddcb/5f18bfd6ad22446281a5e5fe8e2682a4 [2024-10-10 23:32:55,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:32:55,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:32:55,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:32:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:32:55,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:32:55,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:32:55" (1/1) ... [2024-10-10 23:32:55,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d4a83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:55, skipping insertion in model container [2024-10-10 23:32:55,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:32:55" (1/1) ... [2024-10-10 23:32:55,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:32:56,257 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c[6619,6632] [2024-10-10 23:32:56,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:32:56,476 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:32:56,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label15.c[6619,6632] [2024-10-10 23:32:56,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:32:56,656 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:32:56,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56 WrapperNode [2024-10-10 23:32:56,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:32:56,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:32:56,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:32:56,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:32:56,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,760 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:32:56,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:32:56,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:32:56,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:32:56,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:32:56,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,832 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-10-10 23:32:56,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:32:56,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:32:56,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:32:56,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:32:56,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (1/1) ... [2024-10-10 23:32:56,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:32:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:56,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:32:56,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:32:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:32:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:32:56,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:32:56,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:32:57,056 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:32:57,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:32:58,272 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:32:58,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:32:58,329 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:32:58,330 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:32:58,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:58 BoogieIcfgContainer [2024-10-10 23:32:58,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:32:58,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:32:58,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:32:58,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:32:58,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:32:55" (1/3) ... [2024-10-10 23:32:58,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9623c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:32:58, skipping insertion in model container [2024-10-10 23:32:58,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:56" (2/3) ... [2024-10-10 23:32:58,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9623c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:32:58, skipping insertion in model container [2024-10-10 23:32:58,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:58" (3/3) ... [2024-10-10 23:32:58,339 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label15.c [2024-10-10 23:32:58,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:32:58,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:32:58,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:32:58,431 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;@5bf81b14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:32:58,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:32:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 23:32:58,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:58,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:32:58,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:58,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -686964549, now seen corresponding path program 1 times [2024-10-10 23:32:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965719069] [2024-10-10 23:32:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965719069] [2024-10-10 23:32:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965719069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:58,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238812302] [2024-10-10 23:32:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:58,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:32:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:58,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:32:58,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:32:58,716 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:58,759 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:32:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:32:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-10 23:32:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:58,777 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:32:58,778 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:32:58,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-10 23:32:58,787 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:58,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:32:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:32:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:32:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:32:58,834 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 64 [2024-10-10 23:32:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:58,834 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:32:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:32:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 23:32:58,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:58,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:32:58,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:32:58,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:58,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1812181628, now seen corresponding path program 1 times [2024-10-10 23:32:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4144891] [2024-10-10 23:32:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:59,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:59,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4144891] [2024-10-10 23:32:59,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4144891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:59,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:59,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831422773] [2024-10-10 23:32:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:59,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:59,071 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:59,952 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-10 23:32:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-10 23:32:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:59,956 INFO L225 Difference]: With dead ends: 539 [2024-10-10 23:32:59,960 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:32:59,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 23:32:59,962 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:59,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:32:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:32:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:32:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-10 23:32:59,996 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 64 [2024-10-10 23:32:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:59,997 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-10 23:32:59,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-10 23:33:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-10 23:33:00,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:00,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:00,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:33:00,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:00,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2085951228, now seen corresponding path program 1 times [2024-10-10 23:33:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:00,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402093750] [2024-10-10 23:33:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:00,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402093750] [2024-10-10 23:33:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402093750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:00,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:00,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170748426] [2024-10-10 23:33:00,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:00,471 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:01,381 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-10 23:33:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2024-10-10 23:33:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:01,386 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:33:01,386 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:33:01,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-10 23:33:01,389 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:01,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:33:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:33:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:33:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-10 23:33:01,414 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 143 [2024-10-10 23:33:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-10 23:33:01,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-10 23:33:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-10 23:33:01,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:01,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:33:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:33:01,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1250721565, now seen corresponding path program 1 times [2024-10-10 23:33:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865553708] [2024-10-10 23:33:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 23:33:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865553708] [2024-10-10 23:33:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865553708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58456268] [2024-10-10 23:33:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:01,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:01,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:01,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:01,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:33:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:01,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:01,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 23:33:02,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58456268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:33:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143916879] [2024-10-10 23:33:02,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:02,128 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:02,718 INFO L93 Difference]: Finished difference Result 1251 states and 1611 transitions. [2024-10-10 23:33:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-10-10 23:33:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:02,724 INFO L225 Difference]: With dead ends: 1251 [2024-10-10 23:33:02,724 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:02,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:02,725 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:02,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 34 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 893. [2024-10-10 23:33:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-10 23:33:02,753 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 169 [2024-10-10 23:33:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-10 23:33:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-10 23:33:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-10 23:33:02,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:02,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:02,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:33:02,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:02,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:02,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1466948183, now seen corresponding path program 1 times [2024-10-10 23:33:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843641188] [2024-10-10 23:33:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:33:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843641188] [2024-10-10 23:33:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843641188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137486347] [2024-10-10 23:33:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:03,241 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:03,979 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-10 23:33:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-10 23:33:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:03,984 INFO L225 Difference]: With dead ends: 1992 [2024-10-10 23:33:03,984 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:33:03,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:03,987 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:03,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 118 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:33:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-10 23:33:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-10 23:33:04,009 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 223 [2024-10-10 23:33:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:04,010 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-10 23:33:04,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-10 23:33:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-10 23:33:04,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:04,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:33:04,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:33:04,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:04,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1337264915, now seen corresponding path program 1 times [2024-10-10 23:33:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524092846] [2024-10-10 23:33:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524092846] [2024-10-10 23:33:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524092846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565525097] [2024-10-10 23:33:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:04,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:04,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:33:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:04,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:04,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:33:04,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565525097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 23:33:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088642223] [2024-10-10 23:33:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:04,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:04,741 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:05,294 INFO L93 Difference]: Finished difference Result 2319 states and 2778 transitions. [2024-10-10 23:33:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:05,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2024-10-10 23:33:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:05,299 INFO L225 Difference]: With dead ends: 2319 [2024-10-10 23:33:05,299 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:05,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:05,302 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:05,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1071. [2024-10-10 23:33:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1672897196261682) internal successors, (1249), 1070 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1249 transitions. [2024-10-10 23:33:05,321 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1249 transitions. Word has length 235 [2024-10-10 23:33:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:05,321 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1249 transitions. [2024-10-10 23:33:05,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1249 transitions. [2024-10-10 23:33:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-10 23:33:05,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:05,325 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:33:05,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:05,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:05,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -511155190, now seen corresponding path program 1 times [2024-10-10 23:33:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966670386] [2024-10-10 23:33:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:05,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966670386] [2024-10-10 23:33:05,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966670386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:05,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:05,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814039250] [2024-10-10 23:33:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:05,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:05,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:05,788 INFO L87 Difference]: Start difference. First operand 1071 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:06,343 INFO L93 Difference]: Finished difference Result 2853 states and 3361 transitions. [2024-10-10 23:33:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-10-10 23:33:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:06,349 INFO L225 Difference]: With dead ends: 2853 [2024-10-10 23:33:06,349 INFO L226 Difference]: Without dead ends: 1783 [2024-10-10 23:33:06,351 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-10-10 23:33:06,351 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:06,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-10 23:33:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-10-10 23:33:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1290684624017957) internal successors, (2012), 1782 states have internal predecessors, (2012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2012 transitions. [2024-10-10 23:33:06,381 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2012 transitions. Word has length 238 [2024-10-10 23:33:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:06,382 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2012 transitions. [2024-10-10 23:33:06,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2012 transitions. [2024-10-10 23:33:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-10 23:33:06,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:06,387 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:33:06,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:06,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash 782578460, now seen corresponding path program 1 times [2024-10-10 23:33:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809878234] [2024-10-10 23:33:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-10 23:33:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809878234] [2024-10-10 23:33:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809878234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437732051] [2024-10-10 23:33:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:06,746 INFO L87 Difference]: Start difference. First operand 1783 states and 2012 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:07,357 INFO L93 Difference]: Finished difference Result 3623 states and 4104 transitions. [2024-10-10 23:33:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-10-10 23:33:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:07,364 INFO L225 Difference]: With dead ends: 3623 [2024-10-10 23:33:07,364 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:33:07,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:07,367 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:07,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:33:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-10 23:33:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.084736251402918) internal successors, (1933), 1782 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1933 transitions. [2024-10-10 23:33:07,399 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1933 transitions. Word has length 355 [2024-10-10 23:33:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1933 transitions. [2024-10-10 23:33:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1933 transitions. [2024-10-10 23:33:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-10 23:33:07,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:07,408 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:33:07,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:33:07,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:07,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash -345047094, now seen corresponding path program 1 times [2024-10-10 23:33:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:07,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242842012] [2024-10-10 23:33:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:07,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:07,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242842012] [2024-10-10 23:33:07,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242842012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:07,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:07,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601103940] [2024-10-10 23:33:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:07,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:07,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:07,862 INFO L87 Difference]: Start difference. First operand 1783 states and 1933 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:08,394 INFO L93 Difference]: Finished difference Result 4277 states and 4674 transitions. [2024-10-10 23:33:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 450 [2024-10-10 23:33:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:08,404 INFO L225 Difference]: With dead ends: 4277 [2024-10-10 23:33:08,404 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:33:08,407 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-10-10 23:33:08,408 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:08,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:33:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2139. [2024-10-10 23:33:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0720299345182414) internal successors, (2292), 2138 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2292 transitions. [2024-10-10 23:33:08,455 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2292 transitions. Word has length 450 [2024-10-10 23:33:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:08,455 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2292 transitions. [2024-10-10 23:33:08,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2292 transitions. [2024-10-10 23:33:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-10-10 23:33:08,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:08,462 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:08,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:33:08,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:08,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1675878437, now seen corresponding path program 1 times [2024-10-10 23:33:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095901501] [2024-10-10 23:33:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095901501] [2024-10-10 23:33:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095901501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100274179] [2024-10-10 23:33:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:08,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:08,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:08,874 INFO L87 Difference]: Start difference. First operand 2139 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:09,417 INFO L93 Difference]: Finished difference Result 4811 states and 5227 transitions. [2024-10-10 23:33:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2024-10-10 23:33:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:09,427 INFO L225 Difference]: With dead ends: 4811 [2024-10-10 23:33:09,427 INFO L226 Difference]: Without dead ends: 2851 [2024-10-10 23:33:09,430 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-10-10 23:33:09,431 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:09,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-10 23:33:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2024-10-10 23:33:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.07859649122807) internal successors, (3074), 2850 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3074 transitions. [2024-10-10 23:33:09,512 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3074 transitions. Word has length 457 [2024-10-10 23:33:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:09,513 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3074 transitions. [2024-10-10 23:33:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3074 transitions. [2024-10-10 23:33:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-10 23:33:09,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:09,524 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:09,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:33:09,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:09,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1895145814, now seen corresponding path program 1 times [2024-10-10 23:33:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:09,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275180750] [2024-10-10 23:33:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275180750] [2024-10-10 23:33:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275180750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016564795] [2024-10-10 23:33:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:09,817 INFO L87 Difference]: Start difference. First operand 2851 states and 3074 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:10,390 INFO L93 Difference]: Finished difference Result 6591 states and 7211 transitions. [2024-10-10 23:33:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2024-10-10 23:33:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:10,404 INFO L225 Difference]: With dead ends: 6591 [2024-10-10 23:33:10,405 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:10,408 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-10-10 23:33:10,408 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:10,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-10 23:33:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0783267827063447) internal successors, (3841), 3562 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3841 transitions. [2024-10-10 23:33:10,472 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3841 transitions. Word has length 498 [2024-10-10 23:33:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:10,472 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3841 transitions. [2024-10-10 23:33:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3841 transitions. [2024-10-10 23:33:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-10-10 23:33:10,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:10,486 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:10,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:33:10,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 607352642, now seen corresponding path program 1 times [2024-10-10 23:33:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226053439] [2024-10-10 23:33:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 1184 proven. 104 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:33:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226053439] [2024-10-10 23:33:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226053439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779485840] [2024-10-10 23:33:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:11,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:33:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:11,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:11,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2024-10-10 23:33:11,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779485840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745905092] [2024-10-10 23:33:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:11,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:11,619 INFO L87 Difference]: Start difference. First operand 3563 states and 3841 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:12,167 INFO L93 Difference]: Finished difference Result 8015 states and 8684 transitions. [2024-10-10 23:33:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 643 [2024-10-10 23:33:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:12,184 INFO L225 Difference]: With dead ends: 8015 [2024-10-10 23:33:12,184 INFO L226 Difference]: Without dead ends: 4631 [2024-10-10 23:33:12,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:12,190 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 116 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:12,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 244 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-10 23:33:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4453. [2024-10-10 23:33:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0721024258760108) internal successors, (4773), 4452 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4773 transitions. [2024-10-10 23:33:12,272 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4773 transitions. Word has length 643 [2024-10-10 23:33:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4773 transitions. [2024-10-10 23:33:12,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4773 transitions. [2024-10-10 23:33:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2024-10-10 23:33:12,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:12,281 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:12,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:12,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -24943392, now seen corresponding path program 1 times [2024-10-10 23:33:12,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:12,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774708563] [2024-10-10 23:33:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:12,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1239 proven. 104 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:33:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774708563] [2024-10-10 23:33:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774708563] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153060293] [2024-10-10 23:33:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:13,352 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:13,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:33:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:13,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:13,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-10-10 23:33:13,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153060293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:13,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803824411] [2024-10-10 23:33:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:13,659 INFO L87 Difference]: Start difference. First operand 4453 states and 4773 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:14,095 INFO L93 Difference]: Finished difference Result 5345 states and 5725 transitions. [2024-10-10 23:33:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 655 [2024-10-10 23:33:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:14,114 INFO L225 Difference]: With dead ends: 5345 [2024-10-10 23:33:14,114 INFO L226 Difference]: Without dead ends: 5343 [2024-10-10 23:33:14,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:14,117 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:14,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2024-10-10 23:33:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4453. [2024-10-10 23:33:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0718778077268643) internal successors, (4772), 4452 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4772 transitions. [2024-10-10 23:33:14,190 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4772 transitions. Word has length 655 [2024-10-10 23:33:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:14,191 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4772 transitions. [2024-10-10 23:33:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4772 transitions. [2024-10-10 23:33:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-10-10 23:33:14,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:14,199 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:14,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:33:14,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 23:33:14,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:14,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -160367116, now seen corresponding path program 1 times [2024-10-10 23:33:14,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:14,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278331386] [2024-10-10 23:33:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 1271 proven. 104 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:33:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:15,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278331386] [2024-10-10 23:33:15,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278331386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:15,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382701848] [2024-10-10 23:33:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:15,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:15,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:15,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:33:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:15,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:15,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2024-10-10 23:33:15,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382701848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648380627] [2024-10-10 23:33:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:15,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:15,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:15,542 INFO L87 Difference]: Start difference. First operand 4453 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:16,044 INFO L93 Difference]: Finished difference Result 9973 states and 10724 transitions. [2024-10-10 23:33:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 663 [2024-10-10 23:33:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:16,061 INFO L225 Difference]: With dead ends: 9973 [2024-10-10 23:33:16,062 INFO L226 Difference]: Without dead ends: 5699 [2024-10-10 23:33:16,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:16,068 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:16,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 47 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-10-10 23:33:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4987. [2024-10-10 23:33:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0746089049338148) internal successors, (5358), 4986 states have internal predecessors, (5358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5358 transitions. [2024-10-10 23:33:16,148 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5358 transitions. Word has length 663 [2024-10-10 23:33:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:16,149 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5358 transitions. [2024-10-10 23:33:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5358 transitions. [2024-10-10 23:33:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2024-10-10 23:33:16,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:16,158 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:33:16,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:33:16,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:33:16,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2047333484, now seen corresponding path program 1 times [2024-10-10 23:33:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373640941] [2024-10-10 23:33:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 1343 proven. 104 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:33:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373640941] [2024-10-10 23:33:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373640941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725004060] [2024-10-10 23:33:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:17,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:17,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:33:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:17,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:17,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2024-10-10 23:33:17,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725004060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:17,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335533989] [2024-10-10 23:33:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:17,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:17,442 INFO L87 Difference]: Start difference. First operand 4987 states and 5358 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:17,816 INFO L93 Difference]: Finished difference Result 5523 states and 5919 transitions. [2024-10-10 23:33:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 711 [2024-10-10 23:33:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:17,831 INFO L225 Difference]: With dead ends: 5523 [2024-10-10 23:33:17,831 INFO L226 Difference]: Without dead ends: 5521 [2024-10-10 23:33:17,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:17,834 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:17,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 9 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2024-10-10 23:33:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 4809. [2024-10-10 23:33:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.074667221297837) internal successors, (5167), 4808 states have internal predecessors, (5167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5167 transitions. [2024-10-10 23:33:17,906 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5167 transitions. Word has length 711 [2024-10-10 23:33:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:17,906 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5167 transitions. [2024-10-10 23:33:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5167 transitions. [2024-10-10 23:33:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2024-10-10 23:33:17,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:17,917 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:33:17,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 23:33:18,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:33:18,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:18,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1982129, now seen corresponding path program 1 times [2024-10-10 23:33:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490863522] [2024-10-10 23:33:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 1343 proven. 104 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-10 23:33:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490863522] [2024-10-10 23:33:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490863522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951110812] [2024-10-10 23:33:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:18,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:18,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:18,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:18,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 23:33:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:18,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:33:18,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-10-10 23:33:19,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951110812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636125906] [2024-10-10 23:33:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:19,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:19,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:19,496 INFO L87 Difference]: Start difference. First operand 4809 states and 5167 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:19,881 INFO L93 Difference]: Finished difference Result 9617 states and 10348 transitions. [2024-10-10 23:33:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 738 [2024-10-10 23:33:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:19,890 INFO L225 Difference]: With dead ends: 9617 [2024-10-10 23:33:19,890 INFO L226 Difference]: Without dead ends: 4987 [2024-10-10 23:33:19,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:19,896 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:19,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-10 23:33:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4631. [2024-10-10 23:33:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0721382289416848) internal successors, (4964), 4630 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4964 transitions. [2024-10-10 23:33:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4964 transitions. Word has length 738 [2024-10-10 23:33:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:19,958 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4964 transitions. [2024-10-10 23:33:19,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4964 transitions. [2024-10-10 23:33:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-10-10 23:33:19,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:19,970 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:19,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:20,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:20,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1227709128, now seen corresponding path program 1 times [2024-10-10 23:33:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590500172] [2024-10-10 23:33:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2629 backedges. 1701 proven. 0 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-10 23:33:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590500172] [2024-10-10 23:33:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590500172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:20,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104472796] [2024-10-10 23:33:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:20,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:20,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:20,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:20,581 INFO L87 Difference]: Start difference. First operand 4631 states and 4964 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:20,992 INFO L93 Difference]: Finished difference Result 10151 states and 10972 transitions. [2024-10-10 23:33:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 955 [2024-10-10 23:33:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:21,004 INFO L225 Difference]: With dead ends: 10151 [2024-10-10 23:33:21,004 INFO L226 Difference]: Without dead ends: 5699 [2024-10-10 23:33:21,010 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-10-10 23:33:21,011 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 108 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:21,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 36 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-10-10 23:33:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5699. [2024-10-10 23:33:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5698 states have (on average 1.076167076167076) internal successors, (6132), 5698 states have internal predecessors, (6132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 6132 transitions. [2024-10-10 23:33:21,094 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 6132 transitions. Word has length 955 [2024-10-10 23:33:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:21,094 INFO L471 AbstractCegarLoop]: Abstraction has 5699 states and 6132 transitions. [2024-10-10 23:33:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 6132 transitions. [2024-10-10 23:33:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2024-10-10 23:33:21,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:21,108 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:21,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:33:21,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:21,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -954702779, now seen corresponding path program 1 times [2024-10-10 23:33:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811384572] [2024-10-10 23:33:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2657 backedges. 1752 proven. 93 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2024-10-10 23:33:21,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811384572] [2024-10-10 23:33:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811384572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290164592] [2024-10-10 23:33:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:21,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:21,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:21,821 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:21,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 23:33:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:22,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:22,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2657 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-10 23:33:22,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290164592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:33:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449753187] [2024-10-10 23:33:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:22,166 INFO L87 Difference]: Start difference. First operand 5699 states and 6132 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:22,580 INFO L93 Difference]: Finished difference Result 11395 states and 12265 transitions. [2024-10-10 23:33:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 973 [2024-10-10 23:33:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:22,582 INFO L225 Difference]: With dead ends: 11395 [2024-10-10 23:33:22,582 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:33:22,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 972 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:22,590 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:22,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 229 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:33:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:33:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:33:22,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 973 [2024-10-10 23:33:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:22,592 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:33:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:33:22,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:33:22,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:33:22,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 23:33:22,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:33:22,799 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:22,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:33:23,501 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:33:23,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:33:23 BoogieIcfgContainer [2024-10-10 23:33:23,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:33:23,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:33:23,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:33:23,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:33:23,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:58" (3/4) ... [2024-10-10 23:33:23,523 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:33:23,539 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:33:23,540 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:33:23,541 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:33:23,542 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:33:23,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:33:23,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:33:23,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:33:23,712 INFO L158 Benchmark]: Toolchain (without parser) took 27810.53ms. Allocated memory was 182.5MB in the beginning and 775.9MB in the end (delta: 593.5MB). Free memory was 112.5MB in the beginning and 517.4MB in the end (delta: -404.9MB). Peak memory consumption was 190.5MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,712 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:33:23,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 751.64ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 132.2MB in the end (delta: -19.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.31ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 122.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,713 INFO L158 Benchmark]: Boogie Preprocessor took 133.93ms. Allocated memory is still 182.5MB. Free memory was 122.5MB in the beginning and 109.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,713 INFO L158 Benchmark]: RCFGBuilder took 1435.06ms. Allocated memory is still 182.5MB. Free memory was 109.1MB in the beginning and 79.9MB in the end (delta: 29.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,713 INFO L158 Benchmark]: TraceAbstraction took 25186.64ms. Allocated memory was 182.5MB in the beginning and 775.9MB in the end (delta: 593.5MB). Free memory was 78.8MB in the beginning and 532.1MB in the end (delta: -453.3MB). Peak memory consumption was 400.1MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,714 INFO L158 Benchmark]: Witness Printer took 191.12ms. Allocated memory is still 775.9MB. Free memory was 532.1MB in the beginning and 517.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:33:23,715 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 751.64ms. Allocated memory is still 182.5MB. Free memory was 112.3MB in the beginning and 132.2MB in the end (delta: -19.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.31ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 122.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.93ms. Allocated memory is still 182.5MB. Free memory was 122.5MB in the beginning and 109.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1435.06ms. Allocated memory is still 182.5MB. Free memory was 109.1MB in the beginning and 79.9MB in the end (delta: 29.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25186.64ms. Allocated memory was 182.5MB in the beginning and 775.9MB in the end (delta: 593.5MB). Free memory was 78.8MB in the beginning and 532.1MB in the end (delta: -453.3MB). Peak memory consumption was 400.1MB. Max. memory is 16.1GB. * Witness Printer took 191.12ms. Allocated memory is still 775.9MB. Free memory was 532.1MB in the beginning and 517.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 209]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2177 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2177 mSDsluCounter, 2091 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 957 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8573 IncrementalHoareTripleChecker+Invalid, 9530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 957 mSolverCounterUnsat, 2013 mSDtfsCounter, 8573 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4844 GetRequests, 4795 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5699occurred in iteration=17, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 4450 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 13021 NumberOfCodeBlocks, 13021 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 12995 ConstructedInterpolants, 0 QuantifiedInterpolants, 48018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6028 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 28625/29353 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((a24 == 1) && (10 <= a21)) || (((6 <= a15) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || (((a12 <= 80) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a21 <= 6))) || ((((7 <= a15) && (a15 <= 8)) && (((long long) 49 + a12) <= 0)) && (10 <= a21))) || (((a24 == 1) && (a21 <= 8)) && (8 <= a15))) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) || (((a12 <= 11) && (a24 == 1)) && (a15 <= 8))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:33:23,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE