/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:00:50,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:00:50,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:00:50,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:00:50,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:00:50,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:00:50,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:00:50,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:00:50,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:00:50,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:00:50,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:00:50,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:00:50,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:00:50,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:00:50,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:00:50,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:00:50,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:00:50,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:00:50,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:00:50,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:00:50,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:00:50,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:00:50,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:00:50,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:00:50,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:00:50,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:00:50,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:00:50,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:00:50,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:00:50,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:00:50,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:00:50,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:00:50,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:00:50,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:00:50,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:00:50,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:00:50,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:00:50,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:00:50,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:00:50,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:00:50,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:00:50,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:00:50,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:00:50,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:00:50,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:00:50,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:00:50,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:00:50,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:00:50,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:00:50,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:00:50,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:00:50,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:00:50,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:00:50,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:00:50,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:00:50,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:00:50,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:00:50,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:00:50,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:00:50,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:00:50,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:00:50,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:00:50,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:00:50,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:00:50,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:00:50,989 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:00:50,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann03.c [2022-01-10 01:00:51,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c049aac0a/d939508ff20e4d089974cd83ed1d2358/FLAG623b4210a [2022-01-10 01:00:51,401 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:00:51,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann03.c [2022-01-10 01:00:51,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c049aac0a/d939508ff20e4d089974cd83ed1d2358/FLAG623b4210a [2022-01-10 01:00:51,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c049aac0a/d939508ff20e4d089974cd83ed1d2358 [2022-01-10 01:00:51,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:00:51,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:00:51,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:00:51,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:00:51,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:00:51,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1083380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51, skipping insertion in model container [2022-01-10 01:00:51,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:00:51,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:00:51,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann03.c[1168,1181] [2022-01-10 01:00:51,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:00:51,614 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:00:51,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann03.c[1168,1181] [2022-01-10 01:00:51,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:00:51,641 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:00:51,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51 WrapperNode [2022-01-10 01:00:51,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:00:51,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:00:51,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:00:51,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:00:51,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,665 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-01-10 01:00:51,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:00:51,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:00:51,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:00:51,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:00:51,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:00:51,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:00:51,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:00:51,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:00:51,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (1/1) ... [2022-01-10 01:00:51,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:00:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:51,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:00:51,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:00:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:00:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:00:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:00:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-01-10 01:00:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-01-10 01:00:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:00:51,926 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:00:51,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:00:52,080 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:00:52,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:00:52,084 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:00:52,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:52 BoogieIcfgContainer [2022-01-10 01:00:52,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:00:52,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:00:52,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:00:52,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:00:52,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:51" (1/3) ... [2022-01-10 01:00:52,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83d217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:52, skipping insertion in model container [2022-01-10 01:00:52,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:51" (2/3) ... [2022-01-10 01:00:52,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83d217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:52, skipping insertion in model container [2022-01-10 01:00:52,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:52" (3/3) ... [2022-01-10 01:00:52,112 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2022-01-10 01:00:52,116 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:00:52,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:00:52,156 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:00:52,160 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:00:52,161 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:00:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 01:00:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 01:00:52,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:52,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:52,179 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2022-01-10 01:00:52,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:52,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454002470] [2022-01-10 01:00:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:52,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:00:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:00:52,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:52,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454002470] [2022-01-10 01:00:52,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454002470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:00:52,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:00:52,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:00:52,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350116288] [2022-01-10 01:00:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:00:52,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:00:52,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:00:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:00:52,387 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:52,475 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-01-10 01:00:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:00:52,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-10 01:00:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:52,482 INFO L225 Difference]: With dead ends: 51 [2022-01-10 01:00:52,483 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 01:00:52,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:00:52,488 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:52,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:00:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 01:00:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 01:00:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 01:00:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-10 01:00:52,512 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2022-01-10 01:00:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:52,512 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-10 01:00:52,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:00:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-10 01:00:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 01:00:52,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:52,514 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:52,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:00:52,515 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2022-01-10 01:00:52,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:52,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38273891] [2022-01-10 01:00:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:52,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:00:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:00:52,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:52,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38273891] [2022-01-10 01:00:52,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38273891] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115076283] [2022-01-10 01:00:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:52,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:52,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:52,609 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) [2022-01-10 01:00:52,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:00:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:52,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 01:00:52,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:00:52,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:00:52,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115076283] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:52,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:52,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 01:00:52,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215110638] [2022-01-10 01:00:52,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:52,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 01:00:52,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 01:00:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:00:52,856 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 01:00:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:52,962 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2022-01-10 01:00:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:00:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2022-01-10 01:00:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:52,965 INFO L225 Difference]: With dead ends: 74 [2022-01-10 01:00:52,965 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 01:00:52,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:00:52,967 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:52,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:00:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 01:00:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-01-10 01:00:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2022-01-10 01:00:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-01-10 01:00:52,989 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2022-01-10 01:00:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:52,990 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2022-01-10 01:00:52,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 01:00:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2022-01-10 01:00:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 01:00:52,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:52,992 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:53,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 01:00:53,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:53,213 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2022-01-10 01:00:53,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:53,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217105117] [2022-01-10 01:00:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:53,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:00:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:00:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:00:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 01:00:53,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217105117] [2022-01-10 01:00:53,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217105117] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227219126] [2022-01-10 01:00:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:53,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:53,360 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) [2022-01-10 01:00:53,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:00:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:53,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:00:53,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 01:00:53,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 01:00:53,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227219126] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:53,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:53,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-01-10 01:00:53,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899689103] [2022-01-10 01:00:53,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:53,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 01:00:53,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 01:00:53,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:00:53,955 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 01:00:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:54,040 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2022-01-10 01:00:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 01:00:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2022-01-10 01:00:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:54,042 INFO L225 Difference]: With dead ends: 120 [2022-01-10 01:00:54,042 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 01:00:54,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:00:54,044 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:54,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 83 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:00:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 01:00:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 01:00:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2022-01-10 01:00:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-01-10 01:00:54,054 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2022-01-10 01:00:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:54,055 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-01-10 01:00:54,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 01:00:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-01-10 01:00:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 01:00:54,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:54,057 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:54,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:00:54,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-10 01:00:54,276 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2022-01-10 01:00:54,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:54,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779005912] [2022-01-10 01:00:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:54,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:00:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:00:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:00:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 01:00:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 01:00:54,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:54,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779005912] [2022-01-10 01:00:54,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779005912] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:54,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806244376] [2022-01-10 01:00:54,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:00:54,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:54,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:54,572 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) [2022-01-10 01:00:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:00:54,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:00:54,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:00:54,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 01:00:54,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-01-10 01:00:54,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-01-10 01:00:55,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806244376] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:55,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:55,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2022-01-10 01:00:55,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9001787] [2022-01-10 01:00:55,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:55,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 01:00:55,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 01:00:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-01-10 01:00:55,791 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-01-10 01:00:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:00:56,219 INFO L93 Difference]: Finished difference Result 119 states and 222 transitions. [2022-01-10 01:00:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 01:00:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 79 [2022-01-10 01:00:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:00:56,222 INFO L225 Difference]: With dead ends: 119 [2022-01-10 01:00:56,222 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 01:00:56,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=438, Invalid=1724, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 01:00:56,224 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:00:56,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 185 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:00:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 01:00:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2022-01-10 01:00:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2022-01-10 01:00:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-01-10 01:00:56,233 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2022-01-10 01:00:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:00:56,233 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-01-10 01:00:56,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-01-10 01:00:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-01-10 01:00:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 01:00:56,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:00:56,237 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:00:56,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:00:56,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:56,454 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:00:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:00:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash -714127218, now seen corresponding path program 3 times [2022-01-10 01:00:56,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:00:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369876953] [2022-01-10 01:00:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:00:56,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:00:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:00:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:00:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:00:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:00:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:00:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:00:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:00:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:00:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:00:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:00:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 338 proven. 129 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-01-10 01:00:56,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:00:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369876953] [2022-01-10 01:00:56,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369876953] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:00:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510061707] [2022-01-10 01:00:56,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 01:00:56,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:00:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:00:56,783 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) [2022-01-10 01:00:56,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:00:56,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-01-10 01:00:56,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:00:56,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 01:00:56,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:00:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 315 proven. 141 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-01-10 01:00:57,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:00:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 357 proven. 126 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-01-10 01:00:59,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510061707] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:00:59,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:00:59,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 25] total 41 [2022-01-10 01:00:59,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643330314] [2022-01-10 01:00:59,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:00:59,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-10 01:00:59,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:00:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-10 01:00:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2022-01-10 01:00:59,839 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2022-01-10 01:01:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:00,755 INFO L93 Difference]: Finished difference Result 147 states and 279 transitions. [2022-01-10 01:01:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-10 01:01:00,757 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) Word has length 131 [2022-01-10 01:01:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:00,768 INFO L225 Difference]: With dead ends: 147 [2022-01-10 01:01:00,769 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 01:01:00,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 279 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1123, Invalid=4883, Unknown=0, NotChecked=0, Total=6006 [2022-01-10 01:01:00,772 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:00,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 242 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:01:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 01:01:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2022-01-10 01:01:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-01-10 01:01:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-01-10 01:01:00,784 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 131 [2022-01-10 01:01:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:00,784 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-01-10 01:01:00,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2022-01-10 01:01:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-01-10 01:01:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-01-10 01:01:00,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:00,791 INFO L514 BasicCegarLoop]: trace histogram [33, 33, 20, 13, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:00,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:00,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:00,996 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash -574720791, now seen corresponding path program 4 times [2022-01-10 01:01:00,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:00,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215366788] [2022-01-10 01:01:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:00,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:01:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:01:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:01:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:01:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 220 proven. 700 refuted. 0 times theorem prover too weak. 1702 trivial. 0 not checked. [2022-01-10 01:01:01,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215366788] [2022-01-10 01:01:01,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215366788] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59829193] [2022-01-10 01:01:01,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 01:01:01,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:01,424 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) [2022-01-10 01:01:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:01:01,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 01:01:01,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:01,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 01:01:01,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 282 proven. 646 refuted. 0 times theorem prover too weak. 1694 trivial. 0 not checked. [2022-01-10 01:01:01,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 284 proven. 692 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2022-01-10 01:01:03,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59829193] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:03,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:03,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 11] total 26 [2022-01-10 01:01:03,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064624324] [2022-01-10 01:01:03,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:03,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 01:01:03,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 01:01:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:01:03,790 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 23 states have internal predecessors, (77), 15 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (35), 16 states have call predecessors, (35), 15 states have call successors, (35) [2022-01-10 01:01:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:04,940 INFO L93 Difference]: Finished difference Result 195 states and 402 transitions. [2022-01-10 01:01:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-10 01:01:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 23 states have internal predecessors, (77), 15 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (35), 16 states have call predecessors, (35), 15 states have call successors, (35) Word has length 224 [2022-01-10 01:01:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:04,942 INFO L225 Difference]: With dead ends: 195 [2022-01-10 01:01:04,942 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 01:01:04,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1268, Invalid=4894, Unknown=0, NotChecked=0, Total=6162 [2022-01-10 01:01:04,945 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:04,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 178 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:01:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 01:01:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-01-10 01:01:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2022-01-10 01:01:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-01-10 01:01:04,954 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 224 [2022-01-10 01:01:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:04,954 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-01-10 01:01:04,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 23 states have internal predecessors, (77), 15 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (35), 16 states have call predecessors, (35), 15 states have call successors, (35) [2022-01-10 01:01:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-01-10 01:01:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 01:01:04,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:04,958 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:04,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:05,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:05,166 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842998, now seen corresponding path program 5 times [2022-01-10 01:01:05,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:05,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872243612] [2022-01-10 01:01:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:05,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:01:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2022-01-10 01:01:05,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872243612] [2022-01-10 01:01:05,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872243612] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560272047] [2022-01-10 01:01:05,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 01:01:05,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:05,491 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) [2022-01-10 01:01:05,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:01:05,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-01-10 01:01:05,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:05,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 01:01:05,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2022-01-10 01:01:05,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-01-10 01:01:08,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560272047] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:08,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:08,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 37 [2022-01-10 01:01:08,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514509872] [2022-01-10 01:01:08,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:08,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 01:01:08,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 01:01:08,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 01:01:08,585 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2022-01-10 01:01:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:09,216 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2022-01-10 01:01:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-10 01:01:09,217 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 157 [2022-01-10 01:01:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:09,218 INFO L225 Difference]: With dead ends: 140 [2022-01-10 01:01:09,218 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 01:01:09,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 343 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=847, Invalid=3709, Unknown=0, NotChecked=0, Total=4556 [2022-01-10 01:01:09,221 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 85 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:09,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 232 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:01:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 01:01:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2022-01-10 01:01:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (22), 15 states have call predecessors, (22), 11 states have call successors, (22) [2022-01-10 01:01:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2022-01-10 01:01:09,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 157 [2022-01-10 01:01:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:09,229 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2022-01-10 01:01:09,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2022-01-10 01:01:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2022-01-10 01:01:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 01:01:09,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:09,232 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:09,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:09,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:09,440 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 6 times [2022-01-10 01:01:09,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:09,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103029604] [2022-01-10 01:01:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:09,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:01:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2022-01-10 01:01:09,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103029604] [2022-01-10 01:01:09,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103029604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518100046] [2022-01-10 01:01:09,834 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 01:01:09,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:09,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:09,835 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) [2022-01-10 01:01:09,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 01:01:10,028 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-01-10 01:01:10,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:10,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-10 01:01:10,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2022-01-10 01:01:10,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-01-10 01:01:13,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518100046] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:13,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:13,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2022-01-10 01:01:13,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654867281] [2022-01-10 01:01:13,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:13,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 01:01:13,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 01:01:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 01:01:13,218 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-01-10 01:01:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:13,874 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2022-01-10 01:01:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-10 01:01:13,874 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2022-01-10 01:01:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:13,876 INFO L225 Difference]: With dead ends: 158 [2022-01-10 01:01:13,876 INFO L226 Difference]: Without dead ends: 96 [2022-01-10 01:01:13,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2022-01-10 01:01:13,878 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:13,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 208 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:01:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-10 01:01:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2022-01-10 01:01:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.125) internal successors, (54), 49 states have internal predecessors, (54), 12 states have call successors, (12), 5 states have call predecessors, (12), 11 states have return successors, (26), 17 states have call predecessors, (26), 12 states have call successors, (26) [2022-01-10 01:01:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2022-01-10 01:01:13,902 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 170 [2022-01-10 01:01:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:13,903 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2022-01-10 01:01:13,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-01-10 01:01:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-01-10 01:01:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 01:01:13,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:13,909 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:13,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:14,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:14,128 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2022-01-10 01:01:14,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773142595] [2022-01-10 01:01:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:14,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:01:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:01:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2022-01-10 01:01:14,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:14,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773142595] [2022-01-10 01:01:14,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773142595] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:14,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132780768] [2022-01-10 01:01:14,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 01:01:14,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:14,726 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) [2022-01-10 01:01:14,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 01:01:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:15,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-10 01:01:15,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2022-01-10 01:01:15,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2022-01-10 01:01:16,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132780768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:16,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:16,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2022-01-10 01:01:16,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667868114] [2022-01-10 01:01:16,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:16,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 01:01:16,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:16,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 01:01:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 01:01:16,966 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2022-01-10 01:01:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:19,728 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-01-10 01:01:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-10 01:01:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2022-01-10 01:01:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:19,729 INFO L225 Difference]: With dead ends: 146 [2022-01-10 01:01:19,729 INFO L226 Difference]: Without dead ends: 130 [2022-01-10 01:01:19,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 404 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=880, Invalid=6260, Unknown=0, NotChecked=0, Total=7140 [2022-01-10 01:01:19,731 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:19,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 518 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 01:01:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-01-10 01:01:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2022-01-10 01:01:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 58 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 13 states have return successors, (37), 21 states have call predecessors, (37), 15 states have call successors, (37) [2022-01-10 01:01:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2022-01-10 01:01:19,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 183 [2022-01-10 01:01:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:19,740 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2022-01-10 01:01:19,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2022-01-10 01:01:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2022-01-10 01:01:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 01:01:19,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:19,741 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:19,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:19,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-10 01:01:19,959 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 8 times [2022-01-10 01:01:19,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:19,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115457284] [2022-01-10 01:01:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:19,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:01:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:01:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-10 01:01:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2022-01-10 01:01:20,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:20,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115457284] [2022-01-10 01:01:20,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115457284] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:20,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693983276] [2022-01-10 01:01:20,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:01:20,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:20,388 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) [2022-01-10 01:01:20,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 01:01:20,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:01:20,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:20,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-10 01:01:20,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2022-01-10 01:01:20,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2022-01-10 01:01:24,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693983276] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:24,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:24,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 38 [2022-01-10 01:01:24,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860512375] [2022-01-10 01:01:24,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:24,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-10 01:01:24,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-10 01:01:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 01:01:24,536 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2022-01-10 01:01:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:25,134 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2022-01-10 01:01:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-10 01:01:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) Word has length 196 [2022-01-10 01:01:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:25,136 INFO L225 Difference]: With dead ends: 208 [2022-01-10 01:01:25,136 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 01:01:25,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 434 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2022-01-10 01:01:25,138 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 111 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:25,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 282 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:01:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 01:01:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2022-01-10 01:01:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 16 states have call successors, (16), 6 states have call predecessors, (16), 14 states have return successors, (39), 23 states have call predecessors, (39), 16 states have call successors, (39) [2022-01-10 01:01:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-01-10 01:01:25,148 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 196 [2022-01-10 01:01:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:25,148 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-01-10 01:01:25,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2022-01-10 01:01:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-01-10 01:01:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-10 01:01:25,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:25,150 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:25,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:25,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 01:01:25,363 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash 660925528, now seen corresponding path program 9 times [2022-01-10 01:01:25,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029775623] [2022-01-10 01:01:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:25,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-01-10 01:01:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:01:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-10 01:01:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2022-01-10 01:01:25,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029775623] [2022-01-10 01:01:25,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029775623] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448461861] [2022-01-10 01:01:25,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 01:01:25,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:25,690 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) [2022-01-10 01:01:25,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 01:01:26,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-01-10 01:01:26,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:26,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 01:01:26,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-01-10 01:01:26,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2022-01-10 01:01:28,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448461861] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:28,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:28,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2022-01-10 01:01:28,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977369837] [2022-01-10 01:01:28,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:28,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 01:01:28,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 01:01:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-01-10 01:01:28,189 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-01-10 01:01:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:28,482 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2022-01-10 01:01:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 01:01:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 209 [2022-01-10 01:01:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:28,484 INFO L225 Difference]: With dead ends: 183 [2022-01-10 01:01:28,484 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 01:01:28,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 468 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-01-10 01:01:28,485 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:28,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 261 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:01:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 01:01:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-01-10 01:01:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 15 states have call successors, (15), 6 states have call predecessors, (15), 13 states have return successors, (30), 21 states have call predecessors, (30), 15 states have call successors, (30) [2022-01-10 01:01:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2022-01-10 01:01:28,492 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 209 [2022-01-10 01:01:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:28,492 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2022-01-10 01:01:28,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-01-10 01:01:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-01-10 01:01:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-01-10 01:01:28,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:01:28,494 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:01:28,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:28,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 01:01:28,694 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:01:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:01:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 471385981, now seen corresponding path program 10 times [2022-01-10 01:01:28,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:01:28,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757591244] [2022-01-10 01:01:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:01:28,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:01:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:01:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:01:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:01:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:01:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-01-10 01:01:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:01:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:01:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:01:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 01:01:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:01:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:01:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-10 01:01:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:01:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 228 proven. 513 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2022-01-10 01:01:29,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:01:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757591244] [2022-01-10 01:01:29,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757591244] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:01:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308464885] [2022-01-10 01:01:29,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 01:01:29,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:01:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:01:29,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:01:29,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 01:01:29,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 01:01:29,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:01:29,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:01:29,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:01:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 507 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2022-01-10 01:01:29,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:01:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 522 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2022-01-10 01:01:30,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308464885] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:01:30,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:01:30,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-01-10 01:01:30,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217475807] [2022-01-10 01:01:30,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:01:30,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 01:01:30,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:01:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 01:01:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:01:30,547 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2022-01-10 01:01:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:01:30,672 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-01-10 01:01:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 01:01:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) Word has length 281 [2022-01-10 01:01:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:01:30,673 INFO L225 Difference]: With dead ends: 89 [2022-01-10 01:01:30,673 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 01:01:30,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 639 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:01:30,674 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:01:30,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 90 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:01:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 01:01:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 01:01:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:01:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 01:01:30,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2022-01-10 01:01:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:01:30,675 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 01:01:30,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2022-01-10 01:01:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 01:01:30,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 01:01:30,677 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:01:30,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 01:01:30,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 01:01:30,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 01:01:40,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 01:01:40,191 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 01:01:40,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 01:01:40,191 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2022-01-10 01:01:40,191 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 01:01:40,191 INFO L861 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L861 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L854 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-01-10 01:01:40,192 INFO L861 garLoopResultBuilder]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2022-01-10 01:01:40,192 INFO L854 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-01-10 01:01:40,192 INFO L854 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse14 (= |ackermann_#in~m| 0)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (= ackermann_~m |ackermann_#in~m|))) (let ((.cse8 (<= 4 |ackermann_#t~ret5|)) (.cse9 (and .cse14 .cse3 .cse5)) (.cse2 (<= 3 |ackermann_#t~ret5|)) (.cse6 (<= ackermann_~m 1))) (and (let ((.cse7 (<= 3 |ackermann_#in~n|)) (.cse4 (<= 1 |ackermann_#in~m|)) (.cse0 (<= 5 |ackermann_#t~ret5|)) (.cse1 (<= |ackermann_#t~ret5| 5)) (.cse11 (<= 2 |ackermann_#in~n|)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse12 (<= |ackermann_#t~ret5| 3))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 4 |ackermann_#in~n|) .cse4 .cse5 (<= |ackermann_#in~n| 4) .cse6) (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse2 .cse3 .cse7 .cse4 .cse5 .cse6 .cse8) .cse9 (and .cse0 .cse10 .cse7) (<= 3 |ackermann_#in~m|) (and (<= |ackermann_#t~ret5| 2) .cse4) (and (<= |ackermann_#in~n| 2) .cse11 .cse4 .cse12) (and (<= 6 |ackermann_#t~ret5|) .cse0 .cse2 .cse3 (<= |ackermann_#t~ret5| 6) .cse4 .cse5 .cse6 (<= 5 |ackermann_#in~n|)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 6 |ackermann_#in~n|)) (and .cse0 .cse1 .cse10 .cse11) (and .cse10 .cse12))) (let ((.cse13 (< |ackermann_#in~n| 2))) (or (and .cse3 .cse5 .cse8) .cse9 (and .cse2 .cse3 .cse13 .cse5) (and .cse3 .cse13 (<= 2 |ackermann_#t~ret5|) .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6))) (or .cse14 (not (<= |ackermann_#in~n| 0)))))) [2022-01-10 01:01:40,192 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2022-01-10 01:01:40,193 INFO L858 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-01-10 01:01:40,193 INFO L858 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2022-01-10 01:01:40,193 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2022-01-10 01:01:40,193 INFO L858 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2022-01-10 01:01:40,195 INFO L732 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2022-01-10 01:01:40,197 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:01:40,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:01:40 BoogieIcfgContainer [2022-01-10 01:01:40,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:01:40,202 INFO L158 Benchmark]: Toolchain (without parser) took 48775.72ms. Allocated memory was 203.4MB in the beginning and 690.0MB in the end (delta: 486.5MB). Free memory was 148.0MB in the beginning and 340.4MB in the end (delta: -192.4MB). Peak memory consumption was 402.6MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,202 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:01:40,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.74ms. Allocated memory was 203.4MB in the beginning and 275.8MB in the end (delta: 72.4MB). Free memory was 147.7MB in the beginning and 248.2MB in the end (delta: -100.5MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.22ms. Allocated memory is still 275.8MB. Free memory was 247.7MB in the beginning and 246.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,203 INFO L158 Benchmark]: Boogie Preprocessor took 29.41ms. Allocated memory is still 275.8MB. Free memory was 246.6MB in the beginning and 245.6MB in the end (delta: 997.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,203 INFO L158 Benchmark]: RCFGBuilder took 388.94ms. Allocated memory is still 275.8MB. Free memory was 245.6MB in the beginning and 234.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,204 INFO L158 Benchmark]: TraceAbstraction took 48115.91ms. Allocated memory was 275.8MB in the beginning and 690.0MB in the end (delta: 414.2MB). Free memory was 234.1MB in the beginning and 340.4MB in the end (delta: -106.3MB). Peak memory consumption was 416.4MB. Max. memory is 8.0GB. [2022-01-10 01:01:40,205 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.74ms. Allocated memory was 203.4MB in the beginning and 275.8MB in the end (delta: 72.4MB). Free memory was 147.7MB in the beginning and 248.2MB in the end (delta: -100.5MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.22ms. Allocated memory is still 275.8MB. Free memory was 247.7MB in the beginning and 246.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.41ms. Allocated memory is still 275.8MB. Free memory was 246.6MB in the beginning and 245.6MB in the end (delta: 997.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 388.94ms. Allocated memory is still 275.8MB. Free memory was 245.6MB in the beginning and 234.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 48115.91ms. Allocated memory was 275.8MB in the beginning and 690.0MB in the end (delta: 414.2MB). Free memory was 234.1MB in the beginning and 340.4MB in the end (delta: -106.3MB). Peak memory consumption was 416.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.0s, OverallIterations: 12, TraceHistogramMax: 42, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 2444 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2105 mSDsCounter, 2233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6826 IncrementalHoareTripleChecker+Invalid, 9059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2233 mSolverCounterUnsat, 339 mSDtfsCounter, 6826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4357 GetRequests, 3760 SyntacticMatches, 36 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7995 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=10, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 192 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 526 PreInvPairs, 1368 NumberOfFragments, 262 HoareAnnotationTreeSize, 526 FomulaSimplifications, 73852 FormulaSimplificationTreeSizeReduction, 7.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 592947 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 3400 NumberOfCodeBlocks, 3267 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 5060 ConstructedInterpolants, 0 QuantifiedInterpolants, 10116 SizeOfPredicates, 87 NumberOfNonLiveVariables, 4752 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 40715/50796 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 01:01:40,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...