./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:11:05,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:11:05,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:11:05,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:11:05,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:11:05,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:11:05,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:11:05,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:11:05,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:11:05,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:11:05,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:11:05,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:11:05,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:11:05,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:11:05,928 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:11:05,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:11:05,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:11:05,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:11:05,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:11:05,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:11:05,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:11:05,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:11:05,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:11:05,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:11:05,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:11:05,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:11:05,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:11:05,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:11:05,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:11:05,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:11:05,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:11:05,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:11:05,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:05,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:11:05,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:11:05,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:11:05,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:11:05,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:11:05,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:11:05,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:11:05,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:11:05,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:11:05,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2024-10-11 02:11:06,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:11:06,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:11:06,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:11:06,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:11:06,246 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:11:06,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-10-11 02:11:07,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:11:07,794 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:11:07,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-10-11 02:11:07,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/efdeff11b/f304ed64dffe4c20b4be3037ebe85f08/FLAGd2a885df7 [2024-10-11 02:11:07,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/efdeff11b/f304ed64dffe4c20b4be3037ebe85f08 [2024-10-11 02:11:07,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:11:07,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:11:07,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:07,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:11:07,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:11:07,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:07" (1/1) ... [2024-10-11 02:11:07,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7574c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:07, skipping insertion in model container [2024-10-11 02:11:07,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:07" (1/1) ... [2024-10-11 02:11:07,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:11:08,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-10-11 02:11:08,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:08,048 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:11:08,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-10-11 02:11:08,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:08,084 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:11:08,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08 WrapperNode [2024-10-11 02:11:08,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:08,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:08,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:11:08,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:11:08,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,138 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-11 02:11:08,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:08,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:11:08,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:11:08,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:11:08,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 02:11:08,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:11:08,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:11:08,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:11:08,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:11:08,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (1/1) ... [2024-10-11 02:11:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:08,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:08,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:11:08,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:11:08,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:11:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:11:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:11:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:11:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:11:08,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:11:08,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:11:08,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:11:08,337 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:11:08,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:11:08,600 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-11 02:11:08,600 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:11:08,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:11:08,629 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 02:11:08,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:08 BoogieIcfgContainer [2024-10-11 02:11:08,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:11:08,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:11:08,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:11:08,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:11:08,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:11:07" (1/3) ... [2024-10-11 02:11:08,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe276d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:08, skipping insertion in model container [2024-10-11 02:11:08,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:08" (2/3) ... [2024-10-11 02:11:08,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efe276d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:08, skipping insertion in model container [2024-10-11 02:11:08,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:08" (3/3) ... [2024-10-11 02:11:08,640 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2024-10-11 02:11:08,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:11:08,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:11:08,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:11:08,713 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;@1b397dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:11:08,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:11:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:11:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:11:08,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:08,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:08,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:08,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-11 02:11:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144354063] [2024-10-11 02:11:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144354063] [2024-10-11 02:11:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144354063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:11:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706876189] [2024-10-11 02:11:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:08,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:11:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:11:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:08,919 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:08,940 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-11 02:11:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:11:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 02:11:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:08,948 INFO L225 Difference]: With dead ends: 56 [2024-10-11 02:11:08,948 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:11:08,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:08,956 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:08,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:11:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:11:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 02:11:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:11:08,997 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-11 02:11:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:11:08,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:11:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:09,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:09,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:09,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:11:09,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-11 02:11:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001752836] [2024-10-11 02:11:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001752836] [2024-10-11 02:11:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001752836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591885187] [2024-10-11 02:11:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:09,264 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:09,303 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-11 02:11:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:09,305 INFO L225 Difference]: With dead ends: 36 [2024-10-11 02:11:09,305 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 02:11:09,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:09,306 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:09,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 02:11:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 02:11:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 02:11:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-11 02:11:09,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-11 02:11:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:09,314 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-11 02:11:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-11 02:11:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:09,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:11:09,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:09,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-11 02:11:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097180330] [2024-10-11 02:11:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:09,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937858758] [2024-10-11 02:11:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:09,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:09,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:09,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:11:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:09,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:09,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:09,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:11:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097180330] [2024-10-11 02:11:09,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:11:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937858758] [2024-10-11 02:11:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937858758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:11:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260076701] [2024-10-11 02:11:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:11:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:11:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:11:09,686 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:13,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:16,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:16,554 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-11 02:11:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:11:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:16,556 INFO L225 Difference]: With dead ends: 48 [2024-10-11 02:11:16,557 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 02:11:16,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:16,558 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:16,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2024-10-11 02:11:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 02:11:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 02:11:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:11:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-11 02:11:16,573 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-11 02:11:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:16,574 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-11 02:11:16,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-11 02:11:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:11:16,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:16,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:16,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:11:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:16,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-11 02:11:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854080368] [2024-10-11 02:11:16,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:17,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854080368] [2024-10-11 02:11:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854080368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489574894] [2024-10-11 02:11:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:17,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:17,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:11:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 02:11:17,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:17,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489574894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:17,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-11 02:11:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185153988] [2024-10-11 02:11:17,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:17,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:17,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:17,364 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:17,507 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-11 02:11:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:11:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-11 02:11:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:17,510 INFO L225 Difference]: With dead ends: 52 [2024-10-11 02:11:17,510 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 02:11:17,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:11:17,512 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:17,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 02:11:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 02:11:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:11:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-11 02:11:17,539 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 24 [2024-10-11 02:11:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-11 02:11:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-11 02:11:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 02:11:17,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:17,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:17,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:11:17,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:17,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:17,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-11 02:11:17,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610485486] [2024-10-11 02:11:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610485486] [2024-10-11 02:11:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610485486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:17,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:11:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724885756] [2024-10-11 02:11:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:11:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:11:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:17,895 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:11:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:17,966 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2024-10-11 02:11:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:11:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-11 02:11:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:17,968 INFO L225 Difference]: With dead ends: 92 [2024-10-11 02:11:17,968 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:11:17,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:17,969 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:17,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:11:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:11:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 02:11:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-11 02:11:18,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 30 [2024-10-11 02:11:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:18,005 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-11 02:11:18,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:11:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-11 02:11:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 02:11:18,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:18,006 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:18,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:11:18,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:18,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-11 02:11:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979235204] [2024-10-11 02:11:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979235204] [2024-10-11 02:11:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979235204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:18,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:11:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425762438] [2024-10-11 02:11:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:11:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:18,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:11:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:18,145 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:11:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:18,217 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2024-10-11 02:11:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:11:18,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-10-11 02:11:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:18,218 INFO L225 Difference]: With dead ends: 101 [2024-10-11 02:11:18,218 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 02:11:18,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:18,219 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:18,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 02:11:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-11 02:11:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 02:11:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-11 02:11:18,243 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 36 [2024-10-11 02:11:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:18,244 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-11 02:11:18,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:11:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-11 02:11:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:11:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:18,245 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:11:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:11:18,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-11 02:11:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561076969] [2024-10-11 02:11:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561076969] [2024-10-11 02:11:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561076969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141541967] [2024-10-11 02:11:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:18,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:18,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:11:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:18,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:11:18,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:18,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141541967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:18,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-10-11 02:11:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864454746] [2024-10-11 02:11:18,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:18,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:18,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:18,583 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 02:11:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:18,805 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2024-10-11 02:11:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:11:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 38 [2024-10-11 02:11:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:18,808 INFO L225 Difference]: With dead ends: 188 [2024-10-11 02:11:18,808 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 02:11:18,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:11:18,809 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:18,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 181 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 02:11:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2024-10-11 02:11:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 100 states have (on average 1.25) internal successors, (125), 102 states have internal predecessors, (125), 23 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 02:11:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2024-10-11 02:11:18,863 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 38 [2024-10-11 02:11:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:18,864 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2024-10-11 02:11:18,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 02:11:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2024-10-11 02:11:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:11:18,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:18,865 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:18,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:11:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:19,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-11 02:11:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444773558] [2024-10-11 02:11:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444773558] [2024-10-11 02:11:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444773558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:19,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615588] [2024-10-11 02:11:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:19,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:19,143 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:11:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:19,210 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2024-10-11 02:11:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-11 02:11:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:19,215 INFO L225 Difference]: With dead ends: 230 [2024-10-11 02:11:19,215 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 02:11:19,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:19,219 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:19,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 111 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 02:11:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2024-10-11 02:11:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 119 states have internal predecessors, (147), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 02:11:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2024-10-11 02:11:19,268 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 42 [2024-10-11 02:11:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2024-10-11 02:11:19,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:11:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2024-10-11 02:11:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 02:11:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:19,271 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:11:19,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-11 02:11:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769010462] [2024-10-11 02:11:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:19,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769010462] [2024-10-11 02:11:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769010462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810956218] [2024-10-11 02:11:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:19,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:19,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:19,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:11:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:19,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:19,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:19,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:11:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810956218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:19,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:19,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 14 [2024-10-11 02:11:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439285386] [2024-10-11 02:11:19,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:11:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:11:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:11:19,665 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-11 02:11:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:19,902 INFO L93 Difference]: Finished difference Result 346 states and 459 transitions. [2024-10-11 02:11:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:11:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 44 [2024-10-11 02:11:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:19,906 INFO L225 Difference]: With dead ends: 346 [2024-10-11 02:11:19,907 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 02:11:19,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:11:19,909 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 94 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:19,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 188 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 02:11:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2024-10-11 02:11:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.2513966480446927) internal successors, (224), 181 states have internal predecessors, (224), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 02:11:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 311 transitions. [2024-10-11 02:11:19,962 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 311 transitions. Word has length 44 [2024-10-11 02:11:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 311 transitions. [2024-10-11 02:11:19,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-11 02:11:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 311 transitions. [2024-10-11 02:11:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:11:19,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:19,968 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:19,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:20,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 02:11:20,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-11 02:11:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782469504] [2024-10-11 02:11:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782469504] [2024-10-11 02:11:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782469504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080753643] [2024-10-11 02:11:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:20,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:20,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:20,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:20,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:11:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:20,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:11:20,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:20,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080753643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:20,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-11 02:11:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297782420] [2024-10-11 02:11:20,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:20,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:11:20,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:11:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:11:20,581 INFO L87 Difference]: Start difference. First operand 239 states and 311 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:11:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:20,885 INFO L93 Difference]: Finished difference Result 341 states and 454 transitions. [2024-10-11 02:11:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:11:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 50 [2024-10-11 02:11:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:20,889 INFO L225 Difference]: With dead ends: 341 [2024-10-11 02:11:20,889 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 02:11:20,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:11:20,891 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 116 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:20,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 213 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:11:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 02:11:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 322. [2024-10-11 02:11:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 240 states have (on average 1.2333333333333334) internal successors, (296), 247 states have internal predecessors, (296), 62 states have call successors, (62), 20 states have call predecessors, (62), 19 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-11 02:11:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 419 transitions. [2024-10-11 02:11:20,952 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 419 transitions. Word has length 50 [2024-10-11 02:11:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:20,953 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 419 transitions. [2024-10-11 02:11:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:11:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 419 transitions. [2024-10-11 02:11:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:11:20,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:20,957 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:20,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:11:21,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:11:21,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1904373439, now seen corresponding path program 1 times [2024-10-11 02:11:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48301169] [2024-10-11 02:11:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:11:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:11:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-11 02:11:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48301169] [2024-10-11 02:11:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48301169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313792654] [2024-10-11 02:11:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:21,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:11:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:11:21,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 02:11:21,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-11 02:11:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313792654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:21,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-11 02:11:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520173991] [2024-10-11 02:11:21,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:11:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:11:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:21,545 INFO L87 Difference]: Start difference. First operand 322 states and 419 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 02:11:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:21,662 INFO L93 Difference]: Finished difference Result 580 states and 780 transitions. [2024-10-11 02:11:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:11:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 86 [2024-10-11 02:11:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:21,666 INFO L225 Difference]: With dead ends: 580 [2024-10-11 02:11:21,666 INFO L226 Difference]: Without dead ends: 382 [2024-10-11 02:11:21,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:21,667 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:21,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 196 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-11 02:11:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 369. [2024-10-11 02:11:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 277 states have (on average 1.2382671480144405) internal successors, (343), 283 states have internal predecessors, (343), 72 states have call successors, (72), 20 states have call predecessors, (72), 19 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 02:11:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 486 transitions. [2024-10-11 02:11:21,759 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 486 transitions. Word has length 86 [2024-10-11 02:11:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:21,759 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 486 transitions. [2024-10-11 02:11:21,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 02:11:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 486 transitions. [2024-10-11 02:11:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:11:21,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:21,761 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:21,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:11:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:11:21,962 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1715119347, now seen corresponding path program 2 times [2024-10-11 02:11:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707268171] [2024-10-11 02:11:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:11:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 02:11:22,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707268171] [2024-10-11 02:11:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707268171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124032274] [2024-10-11 02:11:22,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:11:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:22,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:22,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:11:22,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:11:22,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:22,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:11:22,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:11:22,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 02:11:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124032274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:22,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 16 [2024-10-11 02:11:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926517155] [2024-10-11 02:11:22,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:11:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:11:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:11:22,551 INFO L87 Difference]: Start difference. First operand 369 states and 486 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-11 02:11:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:22,838 INFO L93 Difference]: Finished difference Result 510 states and 674 transitions. [2024-10-11 02:11:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 02:11:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) Word has length 86 [2024-10-11 02:11:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:22,844 INFO L225 Difference]: With dead ends: 510 [2024-10-11 02:11:22,844 INFO L226 Difference]: Without dead ends: 379 [2024-10-11 02:11:22,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 181 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:11:22,845 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:22,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 177 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-11 02:11:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2024-10-11 02:11:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 285 states have (on average 1.1964912280701754) internal successors, (341), 285 states have internal predecessors, (341), 70 states have call successors, (70), 20 states have call predecessors, (70), 19 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-11 02:11:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 480 transitions. [2024-10-11 02:11:22,910 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 480 transitions. Word has length 86 [2024-10-11 02:11:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:22,910 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 480 transitions. [2024-10-11 02:11:22,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 12 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-11 02:11:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 480 transitions. [2024-10-11 02:11:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:11:22,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:22,914 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:22,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1117496236, now seen corresponding path program 1 times [2024-10-11 02:11:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126812330] [2024-10-11 02:11:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:11:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:11:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-11 02:11:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126812330] [2024-10-11 02:11:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126812330] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770758849] [2024-10-11 02:11:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:23,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:23,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:11:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 02:11:23,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:23,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-11 02:11:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770758849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:23,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 15 [2024-10-11 02:11:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274273910] [2024-10-11 02:11:23,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:11:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:11:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:11:23,820 INFO L87 Difference]: Start difference. First operand 375 states and 480 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-11 02:11:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:24,115 INFO L93 Difference]: Finished difference Result 488 states and 644 transitions. [2024-10-11 02:11:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 02:11:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 92 [2024-10-11 02:11:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:24,120 INFO L225 Difference]: With dead ends: 488 [2024-10-11 02:11:24,120 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 02:11:24,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 193 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:11:24,121 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 95 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:24,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 181 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:11:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 02:11:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-10-11 02:11:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 283 states have (on average 1.1802120141342756) internal successors, (334), 283 states have internal predecessors, (334), 70 states have call successors, (70), 20 states have call predecessors, (70), 19 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-11 02:11:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 473 transitions. [2024-10-11 02:11:24,182 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 473 transitions. Word has length 92 [2024-10-11 02:11:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 473 transitions. [2024-10-11 02:11:24,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-11 02:11:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 473 transitions. [2024-10-11 02:11:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:11:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:24,184 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:24,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:11:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:11:24,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -32862541, now seen corresponding path program 1 times [2024-10-11 02:11:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430262032] [2024-10-11 02:11:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:24,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776882007] [2024-10-11 02:11:24,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:24,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:24,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 02:11:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:11:24,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:11:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:11:24,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:11:24,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:11:24,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:11:24,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:24,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,803 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:24,845 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:11:24,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:11:24 BoogieIcfgContainer [2024-10-11 02:11:24,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:11:24,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:11:24,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:11:24,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:11:24,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:08" (3/4) ... [2024-10-11 02:11:24,850 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:11:24,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:11:24,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:11:24,915 INFO L158 Benchmark]: Toolchain (without parser) took 17097.21ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 77.7MB in the beginning and 176.6MB in the end (delta: -98.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:11:24,915 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:11:24,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.15ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 64.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.49ms. Allocated memory is still 151.0MB. Free memory was 64.9MB in the beginning and 123.5MB in the end (delta: -58.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,916 INFO L158 Benchmark]: Boogie Preprocessor took 38.72ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,916 INFO L158 Benchmark]: RCFGBuilder took 450.75ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 115.5MB in the end (delta: 6.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,917 INFO L158 Benchmark]: TraceAbstraction took 16215.35ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 114.6MB in the beginning and 180.8MB in the end (delta: -66.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,917 INFO L158 Benchmark]: Witness Printer took 65.91ms. Allocated memory is still 230.7MB. Free memory was 180.8MB in the beginning and 176.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:11:24,919 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.18ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.15ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 64.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.49ms. Allocated memory is still 151.0MB. Free memory was 64.9MB in the beginning and 123.5MB in the end (delta: -58.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.72ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.75ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 115.5MB in the end (delta: 6.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16215.35ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 114.6MB in the beginning and 180.8MB in the end (delta: -66.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 65.91ms. Allocated memory is still 230.7MB. Free memory was 180.8MB in the beginning and 176.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=7, R=2, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=7, R=2, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=7, counter=0, r=-3, u=5, v=1] [L34] EXPR counter++ VAL [A=7, counter=1, r=-3, u=5, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=1, r=-3, u=5, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=7, counter=1, r=-3, u=5, v=1] [L39] EXPR counter++ VAL [A=7, counter=2, r=-3, u=5, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=2, r=-3, u=5, v=1] [L41] COND TRUE !(r > 0) VAL [A=7, counter=2, r=-3, u=5, v=1] [L47] EXPR counter++ VAL [A=7, counter=3, r=-3, u=5, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=3, r=-3, u=5, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=7, counter=3, r=2, u=7, v=1] [L47] EXPR counter++ VAL [A=7, counter=4, r=2, u=7, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=4, r=2, u=7, v=1] [L49] COND TRUE !(r < 0) VAL [A=7, counter=4, r=2, u=7, v=1] [L34] EXPR counter++ VAL [A=7, counter=5, r=2, u=7, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=5, r=2, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=7, counter=5, r=2, u=7, v=1] [L39] EXPR counter++ VAL [A=7, counter=6, r=2, u=7, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=6, r=2, u=7, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=7, counter=6, r=1, u=7, v=3] [L39] EXPR counter++ VAL [A=7, counter=7, r=1, u=7, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=7, r=1, u=7, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=7, counter=7, r=-2, u=7, v=5] [L39] EXPR counter++ VAL [A=7, counter=8, r=-2, u=7, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=8, r=-2, u=7, v=5] [L41] COND TRUE !(r > 0) VAL [A=7, counter=8, r=-2, u=7, v=5] [L47] EXPR counter++ VAL [A=7, counter=9, r=-2, u=7, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=9, r=-2, u=7, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=7, counter=9, r=5, u=9, v=5] [L47] EXPR counter++ VAL [A=7, counter=10, r=5, u=9, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=7, counter=10, r=5, u=9, v=5] [L49] COND TRUE !(r < 0) VAL [A=7, counter=10, r=5, u=9, v=5] [L34] EXPR counter++ VAL [A=7, counter=11, r=5, u=9, v=5] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 1766 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1333 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 741 IncrementalHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 433 mSDtfsCounter, 741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 940 SyntacticMatches, 20 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=12, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 89 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1394 ConstructedInterpolants, 0 QuantifiedInterpolants, 3045 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1491/2044 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:11:24,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE