/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-simple/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:02:43,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:02:43,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:02:43,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:02:43,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:02:43,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:02:43,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:02:43,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:02:43,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:02:43,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:02:43,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:02:43,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:02:43,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:02:43,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:02:43,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:02:43,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:02:43,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:02:43,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:02:43,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:02:43,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:02:43,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:02:43,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:02:43,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:02:43,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:02:43,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:02:43,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:02:43,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:02:43,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:02:43,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:02:43,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:02:43,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:02:43,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:02:43,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:02:43,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:02:43,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:02:43,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:02:43,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:02:43,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:02:43,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:02:43,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:02:43,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:02:43,263 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:02:43,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:02:43,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:02:43,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:02:43,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:02:43,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:02:43,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:02:43,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:02:43,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:02:43,305 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:02:43,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:02:43,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:02:43,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:02:43,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:02:43,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:02:43,307 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:02:43,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:02:43,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:02:43,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:02:43,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:02:43,530 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:02:43,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2022-01-10 01:02:43,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e47178b/a1005af442194fdfb2ffbefff4a5b0ca/FLAG5934a661d [2022-01-10 01:02:43,890 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:02:43,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2022-01-10 01:02:43,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e47178b/a1005af442194fdfb2ffbefff4a5b0ca/FLAG5934a661d [2022-01-10 01:02:43,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e47178b/a1005af442194fdfb2ffbefff4a5b0ca [2022-01-10 01:02:43,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:02:43,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:02:43,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:02:43,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:02:43,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:02:43,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:43" (1/1) ... [2022-01-10 01:02:43,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a30644e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:43, skipping insertion in model container [2022-01-10 01:02:43,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:02:43" (1/1) ... [2022-01-10 01:02:43,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:02:43,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:02:44,078 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-simple/fibo_2calls_6-1.c[946,959] [2022-01-10 01:02:44,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:02:44,085 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:02:44,094 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-simple/fibo_2calls_6-1.c[946,959] [2022-01-10 01:02:44,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:02:44,102 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:02:44,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44 WrapperNode [2022-01-10 01:02:44,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:02:44,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:02:44,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:02:44,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:02:44,108 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:02:44" (1/1) ... [2022-01-10 01:02:44,112 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:02:44" (1/1) ... [2022-01-10 01:02:44,121 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-01-10 01:02:44,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:02:44,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:02:44,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:02:44,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:02:44,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:02:44,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:02:44,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:02:44,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:02:44,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (1/1) ... [2022-01-10 01:02:44,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:02:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:44,159 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:02:44,186 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:02:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:02:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:02:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-01-10 01:02:44,208 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-01-10 01:02:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-01-10 01:02:44,208 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-01-10 01:02:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:02:44,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:02:44,249 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:02:44,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:02:44,354 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:02:44,358 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:02:44,358 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:02:44,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:02:44 BoogieIcfgContainer [2022-01-10 01:02:44,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:02:44,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:02:44,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:02:44,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:02:44,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:02:43" (1/3) ... [2022-01-10 01:02:44,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac1e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:02:44, skipping insertion in model container [2022-01-10 01:02:44,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:02:44" (2/3) ... [2022-01-10 01:02:44,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dac1e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:02:44, skipping insertion in model container [2022-01-10 01:02:44,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:02:44" (3/3) ... [2022-01-10 01:02:44,364 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2022-01-10 01:02:44,384 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:02:44,384 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:02:44,431 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:02:44,436 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:02:44,436 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:02:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 01:02:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 01:02:44,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:44,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:44,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-01-10 01:02:44,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:44,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519183531] [2022-01-10 01:02:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:44,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,580 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:02:44,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:44,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519183531] [2022-01-10 01:02:44,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519183531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:02:44,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:02:44,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:02:44,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058623241] [2022-01-10 01:02:44,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:02:44,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:02:44,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:02:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:44,609 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:02:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:44,659 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-01-10 01:02:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:02:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-01-10 01:02:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:44,665 INFO L225 Difference]: With dead ends: 39 [2022-01-10 01:02:44,665 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 01:02:44,667 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:02:44,669 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:44,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:02:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 01:02:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 01:02:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 01:02:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-01-10 01:02:44,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-01-10 01:02:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:44,695 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-01-10 01:02:44,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:02:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-01-10 01:02:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 01:02:44,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:44,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:44,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:02:44,696 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-01-10 01:02:44,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:44,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92962456] [2022-01-10 01:02:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:44,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,734 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:02:44,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92962456] [2022-01-10 01:02:44,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92962456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:02:44,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:02:44,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:02:44,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134750386] [2022-01-10 01:02:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:02:44,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:02:44,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:02:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:02:44,736 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:02:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:44,766 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-01-10 01:02:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:02:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-01-10 01:02:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:44,767 INFO L225 Difference]: With dead ends: 33 [2022-01-10 01:02:44,767 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 01:02:44,768 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:02:44,768 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:44,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:02:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 01:02:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-01-10 01:02:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 01:02:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-01-10 01:02:44,774 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-01-10 01:02:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:44,774 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-01-10 01:02:44,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:02:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-01-10 01:02:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 01:02:44,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:44,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:44,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:02:44,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-01-10 01:02:44,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926255764] [2022-01-10 01:02:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:44,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 01:02:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:44,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:44,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926255764] [2022-01-10 01:02:44,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926255764] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567386051] [2022-01-10 01:02:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:44,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:44,862 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:02:44,864 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:02:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:44,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:02:44,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:45,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:45,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567386051] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:45,283 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:45,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-01-10 01:02:45,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423521322] [2022-01-10 01:02:45,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:45,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 01:02:45,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 01:02:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:02:45,289 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 01:02:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:45,453 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-01-10 01:02:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:02:45,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-01-10 01:02:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:45,456 INFO L225 Difference]: With dead ends: 55 [2022-01-10 01:02:45,457 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 01:02:45,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:02:45,458 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:45,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 01:02:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-10 01:02:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 01:02:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 01:02:45,463 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-01-10 01:02:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:45,464 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 01:02:45,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 01:02:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 01:02:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 01:02:45,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:45,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:45,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:02:45,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:45,674 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-01-10 01:02:45,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:45,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195755347] [2022-01-10 01:02:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:45,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:45,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:45,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195755347] [2022-01-10 01:02:45,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195755347] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:45,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324754178] [2022-01-10 01:02:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:45,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:45,783 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:02:45,800 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:02:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:45,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:02:45,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:45,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 01:02:46,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324754178] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:46,112 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:46,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-01-10 01:02:46,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091329301] [2022-01-10 01:02:46,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:46,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 01:02:46,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 01:02:46,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:02:46,119 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 01:02:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:46,231 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-01-10 01:02:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:02:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-01-10 01:02:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:46,234 INFO L225 Difference]: With dead ends: 51 [2022-01-10 01:02:46,234 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 01:02:46,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:02:46,235 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:46,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 110 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 01:02:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-01-10 01:02:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 01:02:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-01-10 01:02:46,242 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-01-10 01:02:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:46,242 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-01-10 01:02:46,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 01:02:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-01-10 01:02:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 01:02:46,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:46,243 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:46,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 01:02:46,459 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,SelfDestructingSolverStorable3 [2022-01-10 01:02:46,460 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-01-10 01:02:46,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:46,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961258984] [2022-01-10 01:02:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:46,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 01:02:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:02:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 01:02:46,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:46,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961258984] [2022-01-10 01:02:46,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961258984] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820448685] [2022-01-10 01:02:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:46,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:46,526 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:02:46,527 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:02:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:46,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:46,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 01:02:46,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:02:46,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820448685] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:46,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:46,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-01-10 01:02:46,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067780983] [2022-01-10 01:02:46,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:46,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 01:02:46,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 01:02:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-01-10 01:02:46,916 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:47,089 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-01-10 01:02:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 01:02:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-01-10 01:02:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:47,090 INFO L225 Difference]: With dead ends: 105 [2022-01-10 01:02:47,091 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 01:02:47,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-01-10 01:02:47,092 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:47,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 159 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:02:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 01:02:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-10 01:02:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2022-01-10 01:02:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-01-10 01:02:47,099 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-01-10 01:02:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:47,099 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-01-10 01:02:47,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-01-10 01:02:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 01:02:47,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:47,101 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:47,119 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:02:47,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:47,317 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-01-10 01:02:47,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:47,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846719735] [2022-01-10 01:02:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:47,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 01:02:47,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846719735] [2022-01-10 01:02:47,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846719735] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644108657] [2022-01-10 01:02:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:47,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:47,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:47,464 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:02:47,465 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:02:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:47,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 01:02:47,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 01:02:47,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:02:47,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644108657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:47,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:47,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-01-10 01:02:47,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459847846] [2022-01-10 01:02:47,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:47,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 01:02:47,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:47,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 01:02:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:02:47,867 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:48,111 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-01-10 01:02:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 01:02:48,112 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2022-01-10 01:02:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:48,113 INFO L225 Difference]: With dead ends: 177 [2022-01-10 01:02:48,114 INFO L226 Difference]: Without dead ends: 117 [2022-01-10 01:02:48,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:02:48,115 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:48,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 238 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-10 01:02:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-01-10 01:02:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2022-01-10 01:02:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-01-10 01:02:48,144 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-01-10 01:02:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:48,145 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-01-10 01:02:48,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-01-10 01:02:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-01-10 01:02:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 01:02:48,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:48,147 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:48,167 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:02:48,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:48,359 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-01-10 01:02:48,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:48,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239374752] [2022-01-10 01:02:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:48,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 01:02:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 01:02:48,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239374752] [2022-01-10 01:02:48,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239374752] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567439566] [2022-01-10 01:02:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:48,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:48,496 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:02:48,497 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:02:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:48,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:02:48,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 01:02:48,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:02:49,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567439566] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:49,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:49,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-01-10 01:02:49,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077659408] [2022-01-10 01:02:49,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:49,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 01:02:49,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 01:02:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-01-10 01:02:49,039 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-01-10 01:02:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:49,331 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-01-10 01:02:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 01:02:49,331 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2022-01-10 01:02:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:49,333 INFO L225 Difference]: With dead ends: 255 [2022-01-10 01:02:49,333 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 01:02:49,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-01-10 01:02:49,334 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:49,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 222 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 01:02:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-01-10 01:02:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2022-01-10 01:02:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-01-10 01:02:49,347 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-01-10 01:02:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:49,348 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-01-10 01:02:49,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-01-10 01:02:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-01-10 01:02:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 01:02:49,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:49,350 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:49,375 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:02:49,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:49,566 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1851863125, now seen corresponding path program 1 times [2022-01-10 01:02:49,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:49,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712478547] [2022-01-10 01:02:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:49,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:02:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 01:02:49,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:49,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712478547] [2022-01-10 01:02:49,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712478547] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:49,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660193598] [2022-01-10 01:02:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:49,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:49,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:49,720 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:02:49,721 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:02:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:49,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 01:02:49,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 01:02:49,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 01:02:50,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660193598] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:50,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:50,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-01-10 01:02:50,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321720009] [2022-01-10 01:02:50,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 01:02:50,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 01:02:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-01-10 01:02:50,544 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 01:02:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:50,881 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-01-10 01:02:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 01:02:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) Word has length 79 [2022-01-10 01:02:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:50,883 INFO L225 Difference]: With dead ends: 240 [2022-01-10 01:02:50,883 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 01:02:50,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 01:02:50,884 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:50,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 224 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 01:02:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-01-10 01:02:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2022-01-10 01:02:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-01-10 01:02:50,892 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 79 [2022-01-10 01:02:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:50,892 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-01-10 01:02:50,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 11 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 01:02:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-01-10 01:02:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 01:02:50,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:50,894 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:50,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 01:02:51,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:51,110 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash -31484793, now seen corresponding path program 1 times [2022-01-10 01:02:51,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:51,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86815758] [2022-01-10 01:02:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:51,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:02:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-10 01:02:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-01-10 01:02:51,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:51,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86815758] [2022-01-10 01:02:51,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86815758] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:51,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637216093] [2022-01-10 01:02:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:51,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:51,291 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:02:51,304 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:02:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:51,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:02:51,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 53 proven. 104 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-01-10 01:02:51,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 53 proven. 109 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-01-10 01:02:52,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637216093] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:52,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:52,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2022-01-10 01:02:52,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631469407] [2022-01-10 01:02:52,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:52,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 01:02:52,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 01:02:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:02:52,176 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2022-01-10 01:02:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:52,439 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2022-01-10 01:02:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 01:02:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 134 [2022-01-10 01:02:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:52,441 INFO L225 Difference]: With dead ends: 169 [2022-01-10 01:02:52,441 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 01:02:52,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-01-10 01:02:52,442 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 79 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:52,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 286 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 01:02:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2022-01-10 01:02:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (35), 18 states have call predecessors, (35), 14 states have call successors, (35) [2022-01-10 01:02:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2022-01-10 01:02:52,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 134 [2022-01-10 01:02:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:52,448 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2022-01-10 01:02:52,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 21 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2022-01-10 01:02:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2022-01-10 01:02:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 01:02:52,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:52,449 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:52,468 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:02:52,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:52,671 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2036151949, now seen corresponding path program 2 times [2022-01-10 01:02:52,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838337682] [2022-01-10 01:02:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:52,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:02:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:02:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:02:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 212 proven. 113 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2022-01-10 01:02:53,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:53,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838337682] [2022-01-10 01:02:53,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838337682] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:53,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480561466] [2022-01-10 01:02:53,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:02:53,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:53,128 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:02:53,129 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:02:53,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 01:02:53,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:02:53,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:02:53,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 146 proven. 53 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2022-01-10 01:02:53,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 148 proven. 56 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-01-10 01:02:54,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480561466] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:54,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:54,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 11] total 27 [2022-01-10 01:02:54,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824529228] [2022-01-10 01:02:54,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:54,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 01:02:54,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 01:02:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-01-10 01:02:54,174 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2022-01-10 01:02:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:54,569 INFO L93 Difference]: Finished difference Result 186 states and 278 transitions. [2022-01-10 01:02:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 01:02:54,570 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) Word has length 161 [2022-01-10 01:02:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:54,571 INFO L225 Difference]: With dead ends: 186 [2022-01-10 01:02:54,571 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 01:02:54,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 01:02:54,572 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:54,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 314 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 01:02:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-01-10 01:02:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 14 states have call successors, (14), 9 states have call predecessors, (14), 13 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2022-01-10 01:02:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2022-01-10 01:02:54,577 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 161 [2022-01-10 01:02:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:54,577 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2022-01-10 01:02:54,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2022-01-10 01:02:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2022-01-10 01:02:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-10 01:02:54,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:54,579 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:54,611 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:02:54,798 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,SelfDestructingSolverStorable9 [2022-01-10 01:02:54,798 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -712391191, now seen corresponding path program 3 times [2022-01-10 01:02:54,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483140204] [2022-01-10 01:02:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:54,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:02:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:02:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:02:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 194 proven. 345 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2022-01-10 01:02:55,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483140204] [2022-01-10 01:02:55,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483140204] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:55,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769685429] [2022-01-10 01:02:55,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 01:02:55,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:55,171 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:02:55,178 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:02:55,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-10 01:02:55,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:02:55,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 01:02:55,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 550 proven. 4 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-01-10 01:02:55,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 226 proven. 42 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2022-01-10 01:02:56,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769685429] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:56,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:56,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 28 [2022-01-10 01:02:56,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672041306] [2022-01-10 01:02:56,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:56,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-10 01:02:56,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-10 01:02:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-01-10 01:02:56,083 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 28 states have internal predecessors, (83), 13 states have call successors, (23), 2 states have call predecessors, (23), 12 states have return successors, (31), 18 states have call predecessors, (31), 13 states have call successors, (31) [2022-01-10 01:02:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:56,412 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2022-01-10 01:02:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-10 01:02:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 28 states have internal predecessors, (83), 13 states have call successors, (23), 2 states have call predecessors, (23), 12 states have return successors, (31), 18 states have call predecessors, (31), 13 states have call successors, (31) Word has length 217 [2022-01-10 01:02:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:56,413 INFO L225 Difference]: With dead ends: 226 [2022-01-10 01:02:56,414 INFO L226 Difference]: Without dead ends: 138 [2022-01-10 01:02:56,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 486 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=1924, Unknown=0, NotChecked=0, Total=2256 [2022-01-10 01:02:56,415 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 171 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:56,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 301 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:02:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-01-10 01:02:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2022-01-10 01:02:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 81 states have internal predecessors, (97), 20 states have call successors, (20), 16 states have call predecessors, (20), 14 states have return successors, (39), 22 states have call predecessors, (39), 20 states have call successors, (39) [2022-01-10 01:02:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2022-01-10 01:02:56,427 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 217 [2022-01-10 01:02:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:56,429 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2022-01-10 01:02:56,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.074074074074074) internal successors, (83), 28 states have internal predecessors, (83), 13 states have call successors, (23), 2 states have call predecessors, (23), 12 states have return successors, (31), 18 states have call predecessors, (31), 13 states have call successors, (31) [2022-01-10 01:02:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2022-01-10 01:02:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-01-10 01:02:56,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:56,431 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 19, 19, 17, 16, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 8, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:56,450 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:02:56,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:56,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1066845644, now seen corresponding path program 4 times [2022-01-10 01:02:56,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:56,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385095604] [2022-01-10 01:02:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:56,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:02:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:02:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:02:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:02:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-01-10 01:02:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:02:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:02:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:02:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:02:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 440 proven. 337 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2022-01-10 01:02:57,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:02:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385095604] [2022-01-10 01:02:57,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385095604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:02:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363728313] [2022-01-10 01:02:57,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 01:02:57,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:02:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:02:57,072 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:02:57,073 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:02:57,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 01:02:57,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:02:57,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 01:02:57,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:02:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 140 proven. 508 refuted. 0 times theorem prover too weak. 1580 trivial. 0 not checked. [2022-01-10 01:02:57,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:02:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 140 proven. 529 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2022-01-10 01:02:59,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363728313] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:02:59,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:02:59,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 17] total 34 [2022-01-10 01:02:59,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751402667] [2022-01-10 01:02:59,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:02:59,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 01:02:59,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:02:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 01:02:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 01:02:59,288 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 25 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (40), 20 states have call predecessors, (40), 25 states have call successors, (40) [2022-01-10 01:02:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:02:59,689 INFO L93 Difference]: Finished difference Result 262 states and 380 transitions. [2022-01-10 01:02:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-10 01:02:59,690 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 25 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (40), 20 states have call predecessors, (40), 25 states have call successors, (40) Word has length 283 [2022-01-10 01:02:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:02:59,691 INFO L225 Difference]: With dead ends: 262 [2022-01-10 01:02:59,691 INFO L226 Difference]: Without dead ends: 111 [2022-01-10 01:02:59,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 632 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=1822, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 01:02:59,692 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 106 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:02:59,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 583 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:02:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-10 01:02:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-01-10 01:02:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.144736842105263) internal successors, (87), 73 states have internal predecessors, (87), 17 states have call successors, (17), 15 states have call predecessors, (17), 12 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2022-01-10 01:02:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-01-10 01:02:59,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 283 [2022-01-10 01:02:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:02:59,700 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-01-10 01:02:59,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.909090909090909) internal successors, (96), 34 states have internal predecessors, (96), 25 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (40), 20 states have call predecessors, (40), 25 states have call successors, (40) [2022-01-10 01:02:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-01-10 01:02:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-01-10 01:02:59,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:02:59,702 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:02:59,720 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:02:59,902 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,SelfDestructingSolverStorable11 [2022-01-10 01:02:59,902 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:02:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:02:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 521886258, now seen corresponding path program 5 times [2022-01-10 01:02:59,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:02:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587115351] [2022-01-10 01:02:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:02:59,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:02:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:02:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:03:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:03:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:03:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:03:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:03:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-01-10 01:03:00,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:03:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587115351] [2022-01-10 01:03:00,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587115351] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:03:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744690066] [2022-01-10 01:03:00,571 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 01:03:00,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:03:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:03:00,572 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:03:00,617 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:03:00,683 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-01-10 01:03:00,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:03:00,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 103 conjunts are in the unsatisfiable core [2022-01-10 01:03:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:03:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-01-10 01:03:01,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:03:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-01-10 01:03:02,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744690066] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:03:02,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:03:02,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2022-01-10 01:03:02,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284292340] [2022-01-10 01:03:02,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:03:02,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 01:03:02,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:03:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 01:03:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 01:03:02,817 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) [2022-01-10 01:03:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:03:03,022 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-01-10 01:03:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 01:03:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) Word has length 174 [2022-01-10 01:03:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:03:03,024 INFO L225 Difference]: With dead ends: 123 [2022-01-10 01:03:03,024 INFO L226 Difference]: Without dead ends: 106 [2022-01-10 01:03:03,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 399 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 01:03:03,024 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:03:03,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 1273 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:03:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-10 01:03:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-01-10 01:03:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.144736842105263) internal successors, (87), 73 states have internal predecessors, (87), 17 states have call successors, (17), 15 states have call predecessors, (17), 12 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-01-10 01:03:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-01-10 01:03:03,029 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 174 [2022-01-10 01:03:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:03:03,029 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-01-10 01:03:03,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (23), 23 states have call predecessors, (23), 7 states have call successors, (23) [2022-01-10 01:03:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-01-10 01:03:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 01:03:03,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:03:03,031 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:03:03,052 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:03:03,244 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,SelfDestructingSolverStorable12 [2022-01-10 01:03:03,244 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:03:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:03:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1309374191, now seen corresponding path program 6 times [2022-01-10 01:03:03,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:03:03,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394362916] [2022-01-10 01:03:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:03:03,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:03:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:03:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:03:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:03:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:03:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:03:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:03:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:03:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:03:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:03:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 103 proven. 277 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-01-10 01:03:03,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:03:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394362916] [2022-01-10 01:03:03,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394362916] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:03:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613415944] [2022-01-10 01:03:03,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 01:03:03,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:03:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:03:03,503 INFO L229 MonitoredProcess]: Starting monitored process 13 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:03:03,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-10 01:03:03,597 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-10 01:03:03,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:03:03,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 01:03:03,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:03:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 524 proven. 55 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2022-01-10 01:03:03,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:03:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 103 proven. 271 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-01-10 01:03:04,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613415944] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:03:04,741 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:03:04,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 26 [2022-01-10 01:03:04,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476430047] [2022-01-10 01:03:04,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:03:04,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 01:03:04,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:03:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 01:03:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:03:04,742 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 18 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 13 states have call predecessors, (34), 18 states have call successors, (34) [2022-01-10 01:03:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:03:04,880 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2022-01-10 01:03:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:03:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 18 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 13 states have call predecessors, (34), 18 states have call successors, (34) Word has length 188 [2022-01-10 01:03:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:03:04,880 INFO L225 Difference]: With dead ends: 122 [2022-01-10 01:03:04,880 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 01:03:04,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-01-10 01:03:04,881 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:03:04,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:03:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 01:03:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 01:03:04,882 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:03:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 01:03:04,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2022-01-10 01:03:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:03:04,882 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 01:03:04,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.72) internal successors, (93), 26 states have internal predecessors, (93), 18 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 13 states have call predecessors, (34), 18 states have call successors, (34) [2022-01-10 01:03:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 01:03:04,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 01:03:04,887 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:03:04,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-10 01:03:05,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 01:03:05,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L854 garLoopResultBuilder]: At program point L43(lines 37 44) the Hoare annotation is: (<= 6 |ULTIMATE.start_main_~x~0#1|) [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-01-10 01:03:05,915 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6)) [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L861 garLoopResultBuilder]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2022-01-10 01:03:05,916 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L854 garLoopResultBuilder]: At program point L25-2(line 25) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret6| 1) (<= 1 |fibo2_#t~ret6|)) (not (<= |fibo2_#in~n| 3))) (or (and (<= |fibo2_#t~ret6| 2) (<= 2 |fibo2_#t~ret6|)) (<= fibo2_~n 3) (<= 5 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#in~n| 4) .cse0) (and .cse0 (<= 6 fibo2_~n)) (and (<= 3 |fibo2_#t~ret6|) (<= |fibo2_#t~ret6| 3) .cse0))) (< 1 fibo2_~n)) [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L25-3(line 25) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L858 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2022-01-10 01:03:05,916 INFO L861 garLoopResultBuilder]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2022-01-10 01:03:05,916 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (not (<= |fibo1_#in~n| 1))) [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2022-01-10 01:03:05,917 INFO L854 garLoopResultBuilder]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse1 (<= |fibo1_#in~n| 5)) (.cse2 (<= 3 fibo1_~n)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (and (or (and (<= fibo1_~n 3) .cse0) (and .cse0 (<= 6 fibo1_~n)) (and .cse1 .cse2 .cse0 (<= 5 fibo1_~n)) (and (<= 2 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 2))) (or (<= fibo1_~n 2) (and .cse1 .cse2 .cse0) (and (<= |fibo1_#t~ret4| 5) (<= 5 |fibo1_#t~ret4|)) (and (<= 7 fibo1_~n) .cse0)) (or (<= 4 fibo1_~n) (and (<= 1 |fibo1_#t~ret4|) (<= |fibo1_#t~ret4| 1))) (not (<= |fibo1_#in~n| 1)))) [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2022-01-10 01:03:05,917 INFO L858 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2022-01-10 01:03:05,919 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:03:05,920 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:03:05,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:03:05 BoogieIcfgContainer [2022-01-10 01:03:05,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:03:05,929 INFO L158 Benchmark]: Toolchain (without parser) took 22015.58ms. Allocated memory was 168.8MB in the beginning and 352.3MB in the end (delta: 183.5MB). Free memory was 117.8MB in the beginning and 282.1MB in the end (delta: -164.3MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,929 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 134.5MB in the beginning and 134.4MB in the end (delta: 67.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:03:05,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.67ms. Allocated memory is still 168.8MB. Free memory was 117.6MB in the beginning and 145.0MB in the end (delta: -27.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.81ms. Allocated memory is still 168.8MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,929 INFO L158 Benchmark]: Boogie Preprocessor took 9.84ms. Allocated memory is still 168.8MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,930 INFO L158 Benchmark]: RCFGBuilder took 227.19ms. Allocated memory is still 168.8MB. Free memory was 142.4MB in the beginning and 133.5MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,930 INFO L158 Benchmark]: TraceAbstraction took 21568.01ms. Allocated memory was 168.8MB in the beginning and 352.3MB in the end (delta: 183.5MB). Free memory was 133.1MB in the beginning and 282.1MB in the end (delta: -149.1MB). Peak memory consumption was 159.6MB. Max. memory is 8.0GB. [2022-01-10 01:03:05,931 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 168.8MB. Free memory was 134.5MB in the beginning and 134.4MB in the end (delta: 67.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.67ms. Allocated memory is still 168.8MB. Free memory was 117.6MB in the beginning and 145.0MB in the end (delta: -27.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.81ms. Allocated memory is still 168.8MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 9.84ms. Allocated memory is still 168.8MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.19ms. Allocated memory is still 168.8MB. Free memory was 142.4MB in the beginning and 133.5MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 21568.01ms. Allocated memory was 168.8MB in the beginning and 352.3MB in the end (delta: 183.5MB). Free memory was 133.1MB in the beginning and 282.1MB in the end (delta: -149.1MB). Peak memory consumption was 159.6MB. 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: 41]: 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 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 14, TraceHistogramMax: 22, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1032 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 954 mSDsluCounter, 4134 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3723 mSDsCounter, 1004 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4909 IncrementalHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1004 mSolverCounterUnsat, 411 mSDtfsCounter, 4909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3521 GetRequests, 3127 SyntacticMatches, 35 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=11, InterpolantAutomatonStates: 268, 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, 14 MinimizatonAttempts, 137 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 482 PreInvPairs, 672 NumberOfFragments, 161 HoareAnnotationTreeSize, 482 FomulaSimplifications, 4743 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 7157 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 2835 NumberOfCodeBlocks, 2619 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 4204 ConstructedInterpolants, 0 QuantifiedInterpolants, 8519 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2865 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 15639/19659 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: 37]: Loop Invariant Derived loop invariant: 6 <= x RESULT: Ultimate proved your program to be correct! [2022-01-10 01:03:05,956 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...