./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_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:18:42,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:18:42,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:18:42,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:18:42,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:18:42,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:18:42,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:18:42,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:18:42,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:18:42,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:18:42,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:18:42,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:18:42,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:18:42,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:18:42,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:18:42,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:18:42,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:18:42,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:18:42,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:18:42,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:18:42,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:18:42,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:18:42,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:18:42,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:18:42,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:18:42,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:18:42,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:18:42,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:18:42,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:18:42,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:18:42,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:18:42,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:18:42,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:18:42,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:18:42,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:18:42,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:18:42,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:18:42,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:18:42,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:18:42,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:18:42,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:18:42,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:18:42,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2024-11-19 21:18:42,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:18:42,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:18:42,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:18:42,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:18:42,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:18:42,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-11-19 21:18:44,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:18:44,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:18:44,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-11-19 21:18:44,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd46be86/c0927ff0cd6f43469c8427c012342fea/FLAGa8b1253ed [2024-11-19 21:18:44,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd46be86/c0927ff0cd6f43469c8427c012342fea [2024-11-19 21:18:44,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:18:44,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:18:44,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:18:44,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:18:44,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:18:44,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114252c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44, skipping insertion in model container [2024-11-19 21:18:44,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:18:44,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-19 21:18:44,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:18:44,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:18:44,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-19 21:18:44,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:18:44,834 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:18:44,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44 WrapperNode [2024-11-19 21:18:44,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:18:44,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:18:44,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:18:44,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:18:44,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,873 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-11-19 21:18:44,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:18:44,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:18:44,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:18:44,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:18:44,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 21:18:44,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:18:44,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:18:44,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:18:44,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:18:44,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:18:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:44,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:18:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:18:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:18:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 21:18:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 21:18:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:18:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:18:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:18:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:18:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:18:45,103 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:18:45,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:18:45,296 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-19 21:18:45,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:18:45,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:18:45,311 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 21:18:45,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:45 BoogieIcfgContainer [2024-11-19 21:18:45,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:18:45,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:18:45,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:18:45,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:18:45,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:18:44" (1/3) ... [2024-11-19 21:18:45,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3f369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:45, skipping insertion in model container [2024-11-19 21:18:45,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44" (2/3) ... [2024-11-19 21:18:45,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3f369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:45, skipping insertion in model container [2024-11-19 21:18:45,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:45" (3/3) ... [2024-11-19 21:18:45,322 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2024-11-19 21:18:45,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:18:45,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:18:45,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:18:45,398 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;@3c2f1ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:18:45,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:18:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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-11-19 21:18:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 21:18:45,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2024-11-19 21:18:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072441493] [2024-11-19 21:18:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072441493] [2024-11-19 21:18:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072441493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 21:18:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067786934] [2024-11-19 21:18:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:18:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:18:45,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:18:45,605 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 5.0) internal successors, (10), 2 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), 2 states have call successors, (2) [2024-11-19 21:18:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:45,623 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2024-11-19 21:18:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:18:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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), 2 states have call successors, (2) Word has length 18 [2024-11-19 21:18:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:45,631 INFO L225 Difference]: With dead ends: 61 [2024-11-19 21:18:45,631 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 21:18:45,634 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-11-19 21:18:45,637 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:45,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 21:18:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 21:18:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 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-11-19 21:18:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-19 21:18:45,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2024-11-19 21:18:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:45,667 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-19 21:18:45,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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), 2 states have call successors, (2) [2024-11-19 21:18:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-19 21:18:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:18:45,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:18:45,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2024-11-19 21:18:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606580534] [2024-11-19 21:18:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606580534] [2024-11-19 21:18:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606580534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8283484] [2024-11-19 21:18:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:45,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:45,842 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 21:18:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:45,879 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-19 21:18:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2024-11-19 21:18:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:45,881 INFO L225 Difference]: With dead ends: 37 [2024-11-19 21:18:45,881 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 21:18:45,882 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-11-19 21:18:45,883 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:45,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 21:18:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 21:18:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-11-19 21:18:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-19 21:18:45,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2024-11-19 21:18:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:45,895 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-19 21:18:45,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 21:18:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-19 21:18:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:18:45,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:18:45,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2024-11-19 21:18:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939677729] [2024-11-19 21:18:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:18:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023757084] [2024-11-19 21:18:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:45,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:45,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:18:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:46,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:18:46,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:46,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:18:46,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:46,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939677729] [2024-11-19 21:18:46,280 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:18:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023757084] [2024-11-19 21:18:46,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023757084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:46,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:46,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:18:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690867819] [2024-11-19 21:18:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:46,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:18:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:46,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:18:46,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:46,285 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 21:18:48,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 21:18:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:48,550 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-19 21:18:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:18:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2024-11-19 21:18:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:48,552 INFO L225 Difference]: With dead ends: 49 [2024-11-19 21:18:48,553 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 21:18:48,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:48,555 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 21:18:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 21:18:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-19 21:18:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 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-11-19 21:18:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-11-19 21:18:48,579 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2024-11-19 21:18:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:48,580 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-11-19 21:18:48,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 21:18:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-11-19 21:18:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 21:18:48,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:48,581 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, 1] [2024-11-19 21:18:48,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:18:48,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:48,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:48,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -82041861, now seen corresponding path program 1 times [2024-11-19 21:18:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94778153] [2024-11-19 21:18:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94778153] [2024-11-19 21:18:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94778153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360070377] [2024-11-19 21:18:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:49,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:49,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 21:18:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 21:18:49,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360070377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:49,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:49,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-19 21:18:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582185164] [2024-11-19 21:18:49,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:49,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:18:49,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:49,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:18:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:18:49,396 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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-11-19 21:18:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:49,556 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-19 21:18:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:18:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2024-11-19 21:18:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:49,558 INFO L225 Difference]: With dead ends: 53 [2024-11-19 21:18:49,558 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 21:18:49,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:18:49,559 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:49,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 194 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 21:18:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2024-11-19 21:18:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:18:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-19 21:18:49,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-11-19 21:18:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:49,580 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-19 21:18:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 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-11-19 21:18:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-19 21:18:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 21:18:49,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:49,584 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, 1] [2024-11-19 21:18:49,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:18:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 21:18:49,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1145481658, now seen corresponding path program 1 times [2024-11-19 21:18:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:49,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523630305] [2024-11-19 21:18:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523630305] [2024-11-19 21:18:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523630305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:18:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249831043] [2024-11-19 21:18:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:49,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:18:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:18:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:49,871 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11-19 21:18:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:49,917 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-19 21:18:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:18:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 31 [2024-11-19 21:18:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:49,922 INFO L225 Difference]: With dead ends: 61 [2024-11-19 21:18:49,922 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 21:18:49,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:49,923 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:49,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 21:18:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 21:18:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 21:18:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-19 21:18:49,940 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2024-11-19 21:18:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:49,941 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-19 21:18:49,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11-19 21:18:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-19 21:18:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 21:18:49,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:49,942 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, 1] [2024-11-19 21:18:49,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:18:49,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:49,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1102972225, now seen corresponding path program 1 times [2024-11-19 21:18:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259469760] [2024-11-19 21:18:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259469760] [2024-11-19 21:18:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259469760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:18:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181446885] [2024-11-19 21:18:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:18:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:18:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:50,063 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-19 21:18:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:50,115 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-19 21:18:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:18:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 37 [2024-11-19 21:18:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:50,116 INFO L225 Difference]: With dead ends: 70 [2024-11-19 21:18:50,118 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 21:18:50,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:50,119 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:50,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 21:18:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-19 21:18:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 21:18:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-19 21:18:50,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2024-11-19 21:18:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-19 21:18:50,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-19 21:18:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-19 21:18:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 21:18:50,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:50,143 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, 1] [2024-11-19 21:18:50,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:18:50,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 30895492, now seen corresponding path program 1 times [2024-11-19 21:18:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342609583] [2024-11-19 21:18:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342609583] [2024-11-19 21:18:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342609583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111321049] [2024-11-19 21:18:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:50,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:50,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:50,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 21:18:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 21:18:50,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:50,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111321049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:50,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-19 21:18:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382010990] [2024-11-19 21:18:50,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:18:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:18:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:18:50,459 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:18:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:50,627 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2024-11-19 21:18:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:18:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2024-11-19 21:18:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:50,629 INFO L225 Difference]: With dead ends: 125 [2024-11-19 21:18:50,631 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 21:18:50,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:18:50,632 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:50,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 133 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 21:18:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-11-19 21:18:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 21:18:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-19 21:18:50,669 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2024-11-19 21:18:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:50,669 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-19 21:18:50,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:18:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-19 21:18:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 21:18:50,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:50,671 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, 1] [2024-11-19 21:18:50,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:18:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:50,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash -798356602, now seen corresponding path program 1 times [2024-11-19 21:18:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005115240] [2024-11-19 21:18:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005115240] [2024-11-19 21:18:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005115240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889178139] [2024-11-19 21:18:50,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:50,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:50,950 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-19 21:18:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:51,029 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2024-11-19 21:18:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 43 [2024-11-19 21:18:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:51,033 INFO L225 Difference]: With dead ends: 154 [2024-11-19 21:18:51,034 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 21:18:51,034 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-11-19 21:18:51,035 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:51,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 21:18:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2024-11-19 21:18:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 21:18:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-19 21:18:51,090 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2024-11-19 21:18:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:51,091 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-19 21:18:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-19 21:18:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-19 21:18:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 21:18:51,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:51,093 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, 1] [2024-11-19 21:18:51,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:18:51,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:51,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1023958197, now seen corresponding path program 1 times [2024-11-19 21:18:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374289222] [2024-11-19 21:18:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374289222] [2024-11-19 21:18:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374289222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275267757] [2024-11-19 21:18:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:51,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:51,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 21:18:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:18:51,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:51,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275267757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:51,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-19 21:18:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435738498] [2024-11-19 21:18:51,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:18:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:18:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:18:51,476 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 21:18:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:51,692 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-11-19 21:18:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:18:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2024-11-19 21:18:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:51,694 INFO L225 Difference]: With dead ends: 215 [2024-11-19 21:18:51,694 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 21:18:51,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:18:51,695 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 194 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-11-19 21:18:51,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 194 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 21:18:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2024-11-19 21:18:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 21:18:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2024-11-19 21:18:51,743 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2024-11-19 21:18:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2024-11-19 21:18:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 21:18:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2024-11-19 21:18:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 21:18:51,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:51,747 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, 1] [2024-11-19 21:18:51,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:18:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:51,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1104536814, now seen corresponding path program 1 times [2024-11-19 21:18:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2406001] [2024-11-19 21:18:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:18:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2406001] [2024-11-19 21:18:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2406001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478681386] [2024-11-19 21:18:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:52,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:52,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:52,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:52,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:18:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:18:52,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:52,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:18:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478681386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:52,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-19 21:18:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607419808] [2024-11-19 21:18:52,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:52,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:18:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:18:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:18:52,366 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-19 21:18:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:52,637 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2024-11-19 21:18:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 21:18:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2024-11-19 21:18:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:52,639 INFO L225 Difference]: With dead ends: 207 [2024-11-19 21:18:52,639 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 21:18:52,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:18:52,640 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 158 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:52,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:18:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 21:18:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-19 21:18:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 21:18:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2024-11-19 21:18:52,684 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2024-11-19 21:18:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:52,684 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2024-11-19 21:18:52,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-19 21:18:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2024-11-19 21:18:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:18:52,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:52,686 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, 1] [2024-11-19 21:18:52,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 21:18:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 21:18:52,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash 540498080, now seen corresponding path program 1 times [2024-11-19 21:18:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420718064] [2024-11-19 21:18:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:18:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:18:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-19 21:18:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420718064] [2024-11-19 21:18:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420718064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907907748] [2024-11-19 21:18:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:53,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:53,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:18:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 21:18:53,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 21:18:53,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-19 21:18:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907907748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:53,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-19 21:18:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660581317] [2024-11-19 21:18:53,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:53,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:18:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:18:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:18:53,243 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-11-19 21:18:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:53,369 INFO L93 Difference]: Finished difference Result 487 states and 676 transitions. [2024-11-19 21:18:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:18:53,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 87 [2024-11-19 21:18:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:53,373 INFO L225 Difference]: With dead ends: 487 [2024-11-19 21:18:53,373 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 21:18:53,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 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-11-19 21:18:53,375 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:53,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 182 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 21:18:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 338. [2024-11-19 21:18:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 254 states have (on average 1.2598425196850394) internal successors, (320), 260 states have internal predecessors, (320), 72 states have call successors, (72), 12 states have call predecessors, (72), 11 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 21:18:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 463 transitions. [2024-11-19 21:18:53,465 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 463 transitions. Word has length 87 [2024-11-19 21:18:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:53,465 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 463 transitions. [2024-11-19 21:18:53,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-11-19 21:18:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 463 transitions. [2024-11-19 21:18:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:18:53,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:53,468 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, 1] [2024-11-19 21:18:53,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:18:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:53,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -134976430, now seen corresponding path program 2 times [2024-11-19 21:18:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139646375] [2024-11-19 21:18:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:18:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 21:18:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139646375] [2024-11-19 21:18:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139646375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788382332] [2024-11-19 21:18:53,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:18:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:53,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:53,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:18:54,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:18:54,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:18:54,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 21:18:54,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:54,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 21:18:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788382332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:54,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2024-11-19 21:18:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331011441] [2024-11-19 21:18:54,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:54,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 21:18:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 21:18:54,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:18:54,323 INFO L87 Difference]: Start difference. First operand 338 states and 463 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) [2024-11-19 21:18:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:54,992 INFO L93 Difference]: Finished difference Result 981 states and 1409 transitions. [2024-11-19 21:18:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 21:18:54,993 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) Word has length 87 [2024-11-19 21:18:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:54,997 INFO L225 Difference]: With dead ends: 981 [2024-11-19 21:18:54,998 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 21:18:54,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 21:18:54,999 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 266 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:55,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:18:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 21:18:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 789. [2024-11-19 21:18:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 596 states have (on average 1.2533557046979866) internal successors, (747), 605 states have internal predecessors, (747), 175 states have call successors, (175), 18 states have call predecessors, (175), 17 states have return successors, (174), 165 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-19 21:18:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1096 transitions. [2024-11-19 21:18:55,233 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1096 transitions. Word has length 87 [2024-11-19 21:18:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:55,234 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1096 transitions. [2024-11-19 21:18:55,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) [2024-11-19 21:18:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1096 transitions. [2024-11-19 21:18:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 21:18:55,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:55,236 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, 1] [2024-11-19 21:18:55,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 21:18:55,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:55,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2132027339, now seen corresponding path program 1 times [2024-11-19 21:18:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451560559] [2024-11-19 21:18:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 21:18:55,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451560559] [2024-11-19 21:18:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451560559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977526936] [2024-11-19 21:18:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:55,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:55,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 21:18:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 21:18:55,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:55,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 21:18:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977526936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:56,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2024-11-19 21:18:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117263730] [2024-11-19 21:18:56,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:56,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 21:18:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:56,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 21:18:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:18:56,205 INFO L87 Difference]: Start difference. First operand 789 states and 1096 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-19 21:18:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:56,999 INFO L93 Difference]: Finished difference Result 1281 states and 1780 transitions. [2024-11-19 21:18:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-19 21:18:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 93 [2024-11-19 21:18:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:57,008 INFO L225 Difference]: With dead ends: 1281 [2024-11-19 21:18:57,008 INFO L226 Difference]: Without dead ends: 791 [2024-11-19 21:18:57,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 21:18:57,010 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 358 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:57,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 310 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 21:18:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-19 21:18:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 735. [2024-11-19 21:18:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 551 states have (on average 1.219600725952813) internal successors, (672), 556 states have internal predecessors, (672), 162 states have call successors, (162), 22 states have call predecessors, (162), 21 states have return successors, (161), 156 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-19 21:18:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 995 transitions. [2024-11-19 21:18:57,151 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 995 transitions. Word has length 93 [2024-11-19 21:18:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 995 transitions. [2024-11-19 21:18:57,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-19 21:18:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 995 transitions. [2024-11-19 21:18:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:18:57,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:57,154 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, 1] [2024-11-19 21:18:57,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 21:18:57,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 21:18:57,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:57,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 519126930, now seen corresponding path program 1 times [2024-11-19 21:18:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:57,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101256916] [2024-11-19 21:18:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:18:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 21:18:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:57,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101256916] [2024-11-19 21:18:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101256916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927767869] [2024-11-19 21:18:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:57,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:57,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 21:18:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:57,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 21:18:57,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:57,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 21:18:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927767869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:58,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 24 [2024-11-19 21:18:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499192957] [2024-11-19 21:18:58,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 21:18:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 21:18:58,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:18:58,151 INFO L87 Difference]: Start difference. First operand 735 states and 995 transitions. Second operand has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-19 21:18:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:58,866 INFO L93 Difference]: Finished difference Result 753 states and 1014 transitions. [2024-11-19 21:18:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-19 21:18:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) Word has length 99 [2024-11-19 21:18:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:58,872 INFO L225 Difference]: With dead ends: 753 [2024-11-19 21:18:58,872 INFO L226 Difference]: Without dead ends: 748 [2024-11-19 21:18:58,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=551, Invalid=1009, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 21:18:58,873 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 296 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:58,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 291 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:18:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-11-19 21:18:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 741. [2024-11-19 21:18:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 557 states have (on average 1.18491921005386) internal successors, (660), 560 states have internal predecessors, (660), 162 states have call successors, (162), 22 states have call predecessors, (162), 21 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-19 21:18:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 983 transitions. [2024-11-19 21:18:58,987 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 983 transitions. Word has length 99 [2024-11-19 21:18:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:58,988 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 983 transitions. [2024-11-19 21:18:58,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-19 21:18:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 983 transitions. [2024-11-19 21:18:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 21:18:58,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:58,991 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:58,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 21:18:59,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 21:18:59,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 682851631, now seen corresponding path program 3 times [2024-11-19 21:18:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838251436] [2024-11-19 21:18:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:59,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:18:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:18:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:18:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:18:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:18:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:18:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-19 21:18:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-19 21:18:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:18:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2024-11-19 21:18:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838251436] [2024-11-19 21:18:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838251436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293351996] [2024-11-19 21:18:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:59,309 INFO L87 Difference]: Start difference. First operand 741 states and 983 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:18:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:59,476 INFO L93 Difference]: Finished difference Result 1212 states and 1607 transitions. [2024-11-19 21:18:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 169 [2024-11-19 21:18:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:59,481 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 21:18:59,481 INFO L226 Difference]: Without dead ends: 769 [2024-11-19 21:18:59,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:59,483 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:59,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-19 21:18:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 719. [2024-11-19 21:18:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 543 states have (on average 1.1731123388581952) internal successors, (637), 546 states have internal predecessors, (637), 154 states have call successors, (154), 22 states have call predecessors, (154), 21 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-19 21:18:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 944 transitions. [2024-11-19 21:18:59,633 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 944 transitions. Word has length 169 [2024-11-19 21:18:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:59,633 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 944 transitions. [2024-11-19 21:18:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:18:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 944 transitions. [2024-11-19 21:18:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 21:18:59,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:59,643 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:18:59,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -522912053, now seen corresponding path program 4 times [2024-11-19 21:18:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099047890] [2024-11-19 21:18:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:19:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:19:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:19:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:19:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:19:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:19:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:19:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:19:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:19:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:19:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:19:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:19:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:19:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:19:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:19:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:19:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:19:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-19 21:19:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-19 21:19:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:19:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:19:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 110 proven. 156 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-11-19 21:19:00,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:19:00,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099047890] [2024-11-19 21:19:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099047890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:19:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709778909] [2024-11-19 21:19:00,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 21:19:00,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:19:00,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:19:00,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:19:00,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 21:19:00,335 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 21:19:00,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:19:00,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 21:19:00,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:19:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 368 proven. 142 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-19 21:19:58,673 INFO L311 TraceCheckSpWp]: Computing backward predicates...