./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93a127dc0b7a4d224911518339abd36637a414ede1527bd802daa3550402937e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:03:57,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:03:57,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:03:57,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:03:57,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:03:57,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:03:57,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:03:57,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:03:57,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:03:57,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:03:57,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:03:57,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:03:57,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:03:57,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:03:57,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:03:57,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:03:57,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:03:57,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:03:57,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:03:57,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:03:57,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:03:57,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:03:57,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:03:57,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:03:57,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:03:57,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:03:57,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:03:57,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:03:57,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:03:57,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:03:57,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:03:57,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:03:57,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:03:57,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:03:57,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:03:57,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:03:57,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:03:57,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:03:57,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:03:57,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:03:57,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:03:57,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:03:57,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93a127dc0b7a4d224911518339abd36637a414ede1527bd802daa3550402937e [2024-11-11 17:03:58,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:03:58,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:03:58,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:03:58,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:03:58,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:03:58,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label16.c [2024-11-11 17:03:59,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:03:59,852 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:03:59,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c [2024-11-11 17:03:59,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405cf38af/5d01f2e8c338402ebb8793a8d55d56eb/FLAG71cfabe99 [2024-11-11 17:04:00,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405cf38af/5d01f2e8c338402ebb8793a8d55d56eb [2024-11-11 17:04:00,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:04:00,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:04:00,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:00,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:04:00,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:04:00,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf8040d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00, skipping insertion in model container [2024-11-11 17:04:00,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:04:00,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c[4807,4820] [2024-11-11 17:04:00,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:00,617 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:04:00,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c[4807,4820] [2024-11-11 17:04:00,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:00,738 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:04:00,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00 WrapperNode [2024-11-11 17:04:00,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:00,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:00,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:04:00,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:04:00,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,859 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-11 17:04:00,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:00,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:04:00,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:04:00,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:04:00,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:04:00,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:00,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:01,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:01,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:01,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:01,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:04:01,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:04:01,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:04:01,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:04:01,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (1/1) ... [2024-11-11 17:04:01,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:04:01,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:01,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:04:01,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:04:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:04:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:04:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:04:01,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:04:01,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:04:01,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:04:02,393 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 17:04:02,394 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:04:02,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:04:02,418 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:04:02,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:02 BoogieIcfgContainer [2024-11-11 17:04:02,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:04:02,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:04:02,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:04:02,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:04:02,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:04:00" (1/3) ... [2024-11-11 17:04:02,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590fb587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:02, skipping insertion in model container [2024-11-11 17:04:02,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:00" (2/3) ... [2024-11-11 17:04:02,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590fb587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:02, skipping insertion in model container [2024-11-11 17:04:02,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:02" (3/3) ... [2024-11-11 17:04:02,428 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label16.c [2024-11-11 17:04:02,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:04:02,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:04:02,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:04:02,519 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;@23f8dd0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:04:02,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:04:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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-11-11 17:04:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 17:04:02,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:02,532 INFO L218 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] [2024-11-11 17:04:02,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2024-11-11 17:04:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254496407] [2024-11-11 17:04:02,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:04:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254496407] [2024-11-11 17:04:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254496407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:02,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:04:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848481651] [2024-11-11 17:04:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:02,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:02,933 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-11-11 17:04:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:03,862 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-11 17:04:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-11-11 17:04:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:03,879 INFO L225 Difference]: With dead ends: 669 [2024-11-11 17:04:03,879 INFO L226 Difference]: Without dead ends: 360 [2024-11-11 17:04:03,884 INFO L434 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-11-11 17:04:03,888 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 17:04:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-11 17:04:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-11 17:04:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 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-11-11 17:04:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2024-11-11 17:04:03,955 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 46 [2024-11-11 17:04:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:03,955 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2024-11-11 17:04:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-11-11 17:04:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2024-11-11 17:04:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 17:04:03,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:03,961 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:04:03,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1122061351, now seen corresponding path program 1 times [2024-11-11 17:04:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509170327] [2024-11-11 17:04:03,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:04:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509170327] [2024-11-11 17:04:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509170327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:04:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859491196] [2024-11-11 17:04:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:04,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:04,177 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-11-11 17:04:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:04,923 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2024-11-11 17:04:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2024-11-11 17:04:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:04,928 INFO L225 Difference]: With dead ends: 1074 [2024-11-11 17:04:04,928 INFO L226 Difference]: Without dead ends: 716 [2024-11-11 17:04:04,929 INFO L434 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-11-11 17:04:04,930 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 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.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:04,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:04:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-11 17:04:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2024-11-11 17:04:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 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-11-11 17:04:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2024-11-11 17:04:04,978 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 121 [2024-11-11 17:04:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2024-11-11 17:04:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-11-11 17:04:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2024-11-11 17:04:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 17:04:04,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:04,989 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:04:04,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1078900381, now seen corresponding path program 1 times [2024-11-11 17:04:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827298926] [2024-11-11 17:04:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:04:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827298926] [2024-11-11 17:04:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827298926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145825437] [2024-11-11 17:04:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:05,383 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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-11-11 17:04:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:06,277 INFO L93 Difference]: Finished difference Result 1964 states and 2570 transitions. [2024-11-11 17:04:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2024-11-11 17:04:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:06,283 INFO L225 Difference]: With dead ends: 1964 [2024-11-11 17:04:06,283 INFO L226 Difference]: Without dead ends: 1250 [2024-11-11 17:04:06,284 INFO L434 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-11-11 17:04:06,285 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:06,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:04:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-11 17:04:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-11 17:04:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 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-11-11 17:04:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2024-11-11 17:04:06,317 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 125 [2024-11-11 17:04:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:06,318 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2024-11-11 17:04:06,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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-11-11 17:04:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2024-11-11 17:04:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-11 17:04:06,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:06,321 INFO L218 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, 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] [2024-11-11 17:04:06,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:04:06,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:06,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1282005041, now seen corresponding path program 1 times [2024-11-11 17:04:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:06,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343298866] [2024-11-11 17:04:06,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 17:04:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343298866] [2024-11-11 17:04:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343298866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765033966] [2024-11-11 17:04:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:06,694 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-11-11 17:04:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:07,423 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2024-11-11 17:04:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 205 [2024-11-11 17:04:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:07,430 INFO L225 Difference]: With dead ends: 2705 [2024-11-11 17:04:07,430 INFO L226 Difference]: Without dead ends: 1606 [2024-11-11 17:04:07,432 INFO L434 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-11-11 17:04:07,433 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:07,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:04:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-11 17:04:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2024-11-11 17:04:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 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-11-11 17:04:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2024-11-11 17:04:07,485 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 205 [2024-11-11 17:04:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:07,486 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2024-11-11 17:04:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-11-11 17:04:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2024-11-11 17:04:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-11 17:04:07,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:07,493 INFO L218 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:04:07,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:07,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1376977600, now seen corresponding path program 1 times [2024-11-11 17:04:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050195008] [2024-11-11 17:04:07,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 179 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 17:04:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:08,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050195008] [2024-11-11 17:04:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050195008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104932115] [2024-11-11 17:04:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:08,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:08,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:04:08,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 17:04:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:08,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:08,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-11 17:04:08,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104932115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:08,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:08,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-11 17:04:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952904518] [2024-11-11 17:04:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:08,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:08,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:08,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:04:08,668 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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-11-11 17:04:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:09,246 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2024-11-11 17:04:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 332 [2024-11-11 17:04:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:09,254 INFO L225 Difference]: With dead ends: 3388 [2024-11-11 17:04:09,254 INFO L226 Difference]: Without dead ends: 1962 [2024-11-11 17:04:09,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 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-11-11 17:04:09,256 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:09,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:04:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-11 17:04:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-11 17:04:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1318003365114975) internal successors, (2018), 1783 states have internal predecessors, (2018), 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-11-11 17:04:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2018 transitions. [2024-11-11 17:04:09,291 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2018 transitions. Word has length 332 [2024-11-11 17:04:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:09,292 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2018 transitions. [2024-11-11 17:04:09,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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-11-11 17:04:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2018 transitions. [2024-11-11 17:04:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-11 17:04:09,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:09,297 INFO L218 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:09,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:04:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:09,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:09,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -310758602, now seen corresponding path program 1 times [2024-11-11 17:04:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70610976] [2024-11-11 17:04:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 17:04:09,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70610976] [2024-11-11 17:04:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70610976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:09,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218960826] [2024-11-11 17:04:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:09,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:09,887 INFO L87 Difference]: Start difference. First operand 1784 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-11-11 17:04:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:10,416 INFO L93 Difference]: Finished difference Result 3744 states and 4282 transitions. [2024-11-11 17:04:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 336 [2024-11-11 17:04:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:10,424 INFO L225 Difference]: With dead ends: 3744 [2024-11-11 17:04:10,424 INFO L226 Difference]: Without dead ends: 2140 [2024-11-11 17:04:10,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:10,427 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:10,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2024-11-11 17:04:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2024-11-11 17:04:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1280972417017299) internal successors, (2413), 2139 states have internal predecessors, (2413), 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-11-11 17:04:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2413 transitions. [2024-11-11 17:04:10,464 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2413 transitions. Word has length 336 [2024-11-11 17:04:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2413 transitions. [2024-11-11 17:04:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-11-11 17:04:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2413 transitions. [2024-11-11 17:04:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-11 17:04:10,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:10,470 INFO L218 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, 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, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-11 17:04:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:04:10,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1990614980, now seen corresponding path program 1 times [2024-11-11 17:04:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847280988] [2024-11-11 17:04:10,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:10,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847280988] [2024-11-11 17:04:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847280988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:10,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259650581] [2024-11-11 17:04:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:10,717 INFO L87 Difference]: Start difference. First operand 2140 states and 2413 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-11 17:04:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:11,292 INFO L93 Difference]: Finished difference Result 4634 states and 5295 transitions. [2024-11-11 17:04:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 363 [2024-11-11 17:04:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:11,301 INFO L225 Difference]: With dead ends: 4634 [2024-11-11 17:04:11,302 INFO L226 Difference]: Without dead ends: 2674 [2024-11-11 17:04:11,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:11,307 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 135 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:11,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 258 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-11 17:04:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2024-11-11 17:04:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.1208380097268986) internal successors, (2996), 2673 states have internal predecessors, (2996), 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-11-11 17:04:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2996 transitions. [2024-11-11 17:04:11,352 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2996 transitions. Word has length 363 [2024-11-11 17:04:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:11,353 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2996 transitions. [2024-11-11 17:04:11,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-11 17:04:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2996 transitions. [2024-11-11 17:04:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-11 17:04:11,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:11,359 INFO L218 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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:11,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:04:11,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1716712479, now seen corresponding path program 1 times [2024-11-11 17:04:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016879637] [2024-11-11 17:04:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016879637] [2024-11-11 17:04:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016879637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519636513] [2024-11-11 17:04:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:11,625 INFO L87 Difference]: Start difference. First operand 2674 states and 2996 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-11 17:04:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:12,156 INFO L93 Difference]: Finished difference Result 5524 states and 6281 transitions. [2024-11-11 17:04:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 370 [2024-11-11 17:04:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:12,169 INFO L225 Difference]: With dead ends: 5524 [2024-11-11 17:04:12,169 INFO L226 Difference]: Without dead ends: 3030 [2024-11-11 17:04:12,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:12,174 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:12,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 225 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-11 17:04:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2024-11-11 17:04:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.1417046650298142) internal successors, (3255), 2851 states have internal predecessors, (3255), 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-11-11 17:04:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3255 transitions. [2024-11-11 17:04:12,224 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3255 transitions. Word has length 370 [2024-11-11 17:04:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3255 transitions. [2024-11-11 17:04:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-11 17:04:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3255 transitions. [2024-11-11 17:04:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-11-11 17:04:12,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:12,232 INFO L218 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, 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, 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, 1] [2024-11-11 17:04:12,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:04:12,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:12,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -772653983, now seen corresponding path program 1 times [2024-11-11 17:04:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452849417] [2024-11-11 17:04:12,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452849417] [2024-11-11 17:04:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452849417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587745395] [2024-11-11 17:04:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:12,463 INFO L87 Difference]: Start difference. First operand 2852 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-11-11 17:04:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:12,983 INFO L93 Difference]: Finished difference Result 6592 states and 7590 transitions. [2024-11-11 17:04:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 442 [2024-11-11 17:04:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:12,995 INFO L225 Difference]: With dead ends: 6592 [2024-11-11 17:04:12,995 INFO L226 Difference]: Without dead ends: 3920 [2024-11-11 17:04:12,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:13,001 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:13,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 58 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-11-11 17:04:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2024-11-11 17:04:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.13753508548099) internal successors, (4458), 3919 states have internal predecessors, (4458), 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-11-11 17:04:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4458 transitions. [2024-11-11 17:04:13,066 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4458 transitions. Word has length 442 [2024-11-11 17:04:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4458 transitions. [2024-11-11 17:04:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-11-11 17:04:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4458 transitions. [2024-11-11 17:04:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-11-11 17:04:13,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:13,077 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:13,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:04:13,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -9033149, now seen corresponding path program 1 times [2024-11-11 17:04:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209364131] [2024-11-11 17:04:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-11 17:04:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209364131] [2024-11-11 17:04:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209364131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119094066] [2024-11-11 17:04:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:13,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:13,481 INFO L87 Difference]: Start difference. First operand 3920 states and 4458 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-11-11 17:04:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:14,056 INFO L93 Difference]: Finished difference Result 7896 states and 8989 transitions. [2024-11-11 17:04:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:14,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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 517 [2024-11-11 17:04:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:14,070 INFO L225 Difference]: With dead ends: 7896 [2024-11-11 17:04:14,070 INFO L226 Difference]: Without dead ends: 4098 [2024-11-11 17:04:14,075 INFO L434 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-11-11 17:04:14,076 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2024-11-11 17:04:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2024-11-11 17:04:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.0941566726205665) internal successors, (4288), 3919 states have internal predecessors, (4288), 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-11-11 17:04:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4288 transitions. [2024-11-11 17:04:14,135 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4288 transitions. Word has length 517 [2024-11-11 17:04:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:14,135 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4288 transitions. [2024-11-11 17:04:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-11-11 17:04:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4288 transitions. [2024-11-11 17:04:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-11 17:04:14,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:14,140 INFO L218 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:04:14,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 140749320, now seen corresponding path program 1 times [2024-11-11 17:04:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530934672] [2024-11-11 17:04:14,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2024-11-11 17:04:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530934672] [2024-11-11 17:04:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530934672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066041258] [2024-11-11 17:04:14,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:14,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:04:14,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:04:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:14,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:14,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2024-11-11 17:04:15,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066041258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-11 17:04:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835772600] [2024-11-11 17:04:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:04:15,485 INFO L87 Difference]: Start difference. First operand 3920 states and 4288 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-11-11 17:04:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:15,951 INFO L93 Difference]: Finished difference Result 5168 states and 5636 transitions. [2024-11-11 17:04:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 525 [2024-11-11 17:04:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:15,968 INFO L225 Difference]: With dead ends: 5168 [2024-11-11 17:04:15,969 INFO L226 Difference]: Without dead ends: 5166 [2024-11-11 17:04:15,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 524 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-11-11 17:04:15,971 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:15,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2024-11-11 17:04:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4098. [2024-11-11 17:04:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0956797656822066) internal successors, (4489), 4097 states have internal predecessors, (4489), 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-11-11 17:04:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4489 transitions. [2024-11-11 17:04:16,049 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4489 transitions. Word has length 525 [2024-11-11 17:04:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:16,052 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4489 transitions. [2024-11-11 17:04:16,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-11-11 17:04:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4489 transitions. [2024-11-11 17:04:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-11 17:04:16,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:16,059 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:16,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 17:04:16,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 17:04:16,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -352344850, now seen corresponding path program 1 times [2024-11-11 17:04:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:16,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061765934] [2024-11-11 17:04:16,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 883 proven. 11 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-11 17:04:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061765934] [2024-11-11 17:04:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061765934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646386943] [2024-11-11 17:04:16,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:16,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:16,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:16,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:04:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 17:04:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:17,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:17,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-11-11 17:04:17,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646386943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:17,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 17:04:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853018349] [2024-11-11 17:04:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:17,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:17,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:04:17,241 INFO L87 Difference]: Start difference. First operand 4098 states and 4489 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-11-11 17:04:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:17,671 INFO L93 Difference]: Finished difference Result 5702 states and 6210 transitions. [2024-11-11 17:04:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 572 [2024-11-11 17:04:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:17,699 INFO L225 Difference]: With dead ends: 5702 [2024-11-11 17:04:17,699 INFO L226 Difference]: Without dead ends: 5700 [2024-11-11 17:04:17,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:04:17,706 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:17,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2024-11-11 17:04:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4098. [2024-11-11 17:04:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0956797656822066) internal successors, (4489), 4097 states have internal predecessors, (4489), 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-11-11 17:04:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4489 transitions. [2024-11-11 17:04:17,776 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4489 transitions. Word has length 572 [2024-11-11 17:04:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:17,777 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4489 transitions. [2024-11-11 17:04:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-11-11 17:04:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4489 transitions. [2024-11-11 17:04:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2024-11-11 17:04:17,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:17,783 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 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] [2024-11-11 17:04:17,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 17:04:17,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:17,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:17,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash 774587592, now seen corresponding path program 1 times [2024-11-11 17:04:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:17,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049779307] [2024-11-11 17:04:17,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 848 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-11 17:04:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049779307] [2024-11-11 17:04:18,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049779307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989146400] [2024-11-11 17:04:18,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:18,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:18,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:18,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:04:18,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 17:04:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:18,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:18,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2024-11-11 17:04:18,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989146400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:18,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478389564] [2024-11-11 17:04:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:18,961 INFO L87 Difference]: Start difference. First operand 4098 states and 4489 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-11-11 17:04:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:19,373 INFO L93 Difference]: Finished difference Result 9082 states and 9998 transitions. [2024-11-11 17:04:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:19,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 579 [2024-11-11 17:04:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:19,375 INFO L225 Difference]: With dead ends: 9082 [2024-11-11 17:04:19,375 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:04:19,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 578 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-11-11 17:04:19,385 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 140 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:19,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 48 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:04:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:04:19,386 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-11-11 17:04:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:04:19,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 579 [2024-11-11 17:04:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:04:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-11-11 17:04:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:04:19,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:04:19,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:04:19,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 17:04:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:19,595 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:19,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:04:20,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:04:20,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:04:20 BoogieIcfgContainer [2024-11-11 17:04:20,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:04:20,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:04:20,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:04:20,072 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:04:20,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:02" (3/4) ... [2024-11-11 17:04:20,075 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:04:20,098 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 17:04:20,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:04:20,101 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:04:20,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:04:20,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:04:20,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:04:20,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:04:20,271 INFO L158 Benchmark]: Toolchain (without parser) took 20111.29ms. Allocated memory was 174.1MB in the beginning and 484.4MB in the end (delta: 310.4MB). Free memory was 102.9MB in the beginning and 180.2MB in the end (delta: -77.4MB). Peak memory consumption was 235.4MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,271 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:04:20,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.16ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 67.5MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.66ms. Allocated memory is still 174.1MB. Free memory was 67.5MB in the beginning and 57.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,272 INFO L158 Benchmark]: Boogie Preprocessor took 199.82ms. Allocated memory is still 174.1MB. Free memory was 57.7MB in the beginning and 132.7MB in the end (delta: -75.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,272 INFO L158 Benchmark]: RCFGBuilder took 1357.82ms. Allocated memory is still 174.1MB. Free memory was 132.7MB in the beginning and 96.1MB in the end (delta: 36.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,272 INFO L158 Benchmark]: TraceAbstraction took 17650.63ms. Allocated memory was 174.1MB in the beginning and 484.4MB in the end (delta: 310.4MB). Free memory was 95.1MB in the beginning and 194.9MB in the end (delta: -99.8MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,272 INFO L158 Benchmark]: Witness Printer took 198.32ms. Allocated memory is still 484.4MB. Free memory was 194.9MB in the beginning and 180.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 17:04:20,277 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.17ms. Allocated memory is still 121.6MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.16ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 67.5MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.66ms. Allocated memory is still 174.1MB. Free memory was 67.5MB in the beginning and 57.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.82ms. Allocated memory is still 174.1MB. Free memory was 57.7MB in the beginning and 132.7MB in the end (delta: -75.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1357.82ms. Allocated memory is still 174.1MB. Free memory was 132.7MB in the beginning and 96.1MB in the end (delta: 36.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17650.63ms. Allocated memory was 174.1MB in the beginning and 484.4MB in the end (delta: 310.4MB). Free memory was 95.1MB in the beginning and 194.9MB in the end (delta: -99.8MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. * Witness Printer took 198.32ms. Allocated memory is still 484.4MB. Free memory was 194.9MB in the beginning and 180.2MB 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: 152]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1857 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1857 mSDsluCounter, 1181 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 976 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6854 IncrementalHoareTripleChecker+Invalid, 7830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 976 mSolverCounterUnsat, 1111 mSDtfsCounter, 6854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2046 GetRequests, 2017 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4098occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 6541 NumberOfCodeBlocks, 6541 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6524 ConstructedInterpolants, 0 QuantifiedInterpolants, 22372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2568 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 10272/10608 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: ((((((7 <= a15) && (a24 == 1)) || ((9 <= a21) && (a24 == 1))) || (((a15 <= 8) && (a21 <= 7)) && (((long long) 49 + a12) <= 0))) || ((a12 <= 80) && (a24 == 1))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:04:20,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE