/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:46:12,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:46:12,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:46:12,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:46:12,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:46:12,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:46:12,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:46:12,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:46:12,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:46:12,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:46:12,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:46:12,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:46:12,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:46:12,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:46:12,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:46:12,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:46:12,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:46:12,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:46:12,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:46:12,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:46:12,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:46:12,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:46:12,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:46:12,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:46:12,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:46:12,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:46:12,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:46:12,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:46:12,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:46:12,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:46:12,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:46:12,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:46:12,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:46:12,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:46:12,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:46:12,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:46:12,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:46:12,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:46:12,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:46:12,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:46:12,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:46:12,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:46:13,019 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:46:13,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:46:13,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:46:13,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:46:13,027 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:46:13,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:46:13,027 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:46:13,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:46:13,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:46:13,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:46:13,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:46:13,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:46:13,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:46:13,030 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:46:13,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:46:13,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:46:13,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:46:13,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:46:13,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:46:13,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:46:13,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:46:13,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:46:13,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:46:13,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:46:13,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:46:13,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:46:13,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:46:13,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:46:13,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:46:13,034 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 [2020-11-06 22:46:13,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:46:13,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:46:13,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:46:13,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:46:13,550 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:46:13,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-11-06 22:46:13,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6216386e/180981fd09924c2da64fe964f0b59e8c/FLAG9c80c30f5 [2020-11-06 22:46:14,373 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:46:14,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-11-06 22:46:14,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6216386e/180981fd09924c2da64fe964f0b59e8c/FLAG9c80c30f5 [2020-11-06 22:46:14,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6216386e/180981fd09924c2da64fe964f0b59e8c [2020-11-06 22:46:14,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:46:14,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:46:14,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:46:14,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:46:14,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:46:14,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:14" (1/1) ... [2020-11-06 22:46:14,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7637ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:14, skipping insertion in model container [2020-11-06 22:46:14,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:14" (1/1) ... [2020-11-06 22:46:14,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:46:14,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:46:14,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:46:14,968 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:46:14,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:46:15,008 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:46:15,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15 WrapperNode [2020-11-06 22:46:15,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:46:15,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:46:15,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:46:15,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:46:15,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... [2020-11-06 22:46:15,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:46:15,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:46:15,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:46:15,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:46:15,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:46:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:46:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:46:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:46:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:46:15,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:46:15,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:46:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:46:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:46:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:46:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:46:15,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:46:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:46:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:46:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:46:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:46:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:46:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:46:15,464 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:46:15,464 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:46:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:15 BoogieIcfgContainer [2020-11-06 22:46:15,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:46:15,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:46:15,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:46:15,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:46:15,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:14" (1/3) ... [2020-11-06 22:46:15,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbd8caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:15, skipping insertion in model container [2020-11-06 22:46:15,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:15" (2/3) ... [2020-11-06 22:46:15,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbd8caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:15, skipping insertion in model container [2020-11-06 22:46:15,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:15" (3/3) ... [2020-11-06 22:46:15,478 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-11-06 22:46:15,500 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:46:15,507 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:46:15,525 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:46:15,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:46:15,575 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:46:15,575 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:46:15,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:46:15,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:46:15,576 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:46:15,576 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:46:15,576 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:46:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-11-06 22:46:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-06 22:46:15,622 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:15,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:15,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -928346573, now seen corresponding path program 1 times [2020-11-06 22:46:15,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:15,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686009360] [2020-11-06 22:46:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:16,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686009360] [2020-11-06 22:46:16,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:16,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-06 22:46:16,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051818368] [2020-11-06 22:46:16,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:46:16,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:46:16,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:46:16,067 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-11-06 22:46:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:16,233 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2020-11-06 22:46:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:46:16,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-06 22:46:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:16,245 INFO L225 Difference]: With dead ends: 69 [2020-11-06 22:46:16,245 INFO L226 Difference]: Without dead ends: 32 [2020-11-06 22:46:16,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-06 22:46:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-06 22:46:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-06 22:46:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-06 22:46:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-11-06 22:46:16,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2020-11-06 22:46:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:16,306 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-11-06 22:46:16,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:46:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-11-06 22:46:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-06 22:46:16,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:16,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:16,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:46:16,309 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 759802656, now seen corresponding path program 1 times [2020-11-06 22:46:16,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:16,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314139935] [2020-11-06 22:46:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:16,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314139935] [2020-11-06 22:46:16,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:16,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:16,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875788741] [2020-11-06 22:46:16,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:16,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:16,488 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 6 states. [2020-11-06 22:46:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:16,774 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-11-06 22:46:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:16,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-06 22:46:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:16,777 INFO L225 Difference]: With dead ends: 40 [2020-11-06 22:46:16,777 INFO L226 Difference]: Without dead ends: 36 [2020-11-06 22:46:16,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:46:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-06 22:46:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-11-06 22:46:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-06 22:46:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-11-06 22:46:16,800 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2020-11-06 22:46:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:16,801 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-11-06 22:46:16,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-11-06 22:46:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:46:16,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:16,802 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:16,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:46:16,803 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1080991773, now seen corresponding path program 1 times [2020-11-06 22:46:16,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:16,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276812658] [2020-11-06 22:46:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:46:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:16,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276812658] [2020-11-06 22:46:16,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:16,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:16,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466821493] [2020-11-06 22:46:16,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:16,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:16,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:16,928 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 7 states. [2020-11-06 22:46:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:17,291 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-11-06 22:46:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:17,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-06 22:46:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:17,294 INFO L225 Difference]: With dead ends: 53 [2020-11-06 22:46:17,294 INFO L226 Difference]: Without dead ends: 49 [2020-11-06 22:46:17,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:46:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-06 22:46:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-11-06 22:46:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-06 22:46:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2020-11-06 22:46:17,308 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 23 [2020-11-06 22:46:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:17,309 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2020-11-06 22:46:17,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2020-11-06 22:46:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:46:17,310 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:17,310 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-06 22:46:17,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:46:17,311 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash -476132657, now seen corresponding path program 1 times [2020-11-06 22:46:17,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:17,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749093164] [2020-11-06 22:46:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:46:17,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749093164] [2020-11-06 22:46:17,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:17,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:17,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781437825] [2020-11-06 22:46:17,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:17,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:17,428 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 7 states. [2020-11-06 22:46:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:17,821 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2020-11-06 22:46:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:17,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-11-06 22:46:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:17,824 INFO L225 Difference]: With dead ends: 60 [2020-11-06 22:46:17,824 INFO L226 Difference]: Without dead ends: 56 [2020-11-06 22:46:17,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:46:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-06 22:46:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2020-11-06 22:46:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-06 22:46:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-11-06 22:46:17,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 31 [2020-11-06 22:46:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:17,838 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-11-06 22:46:17,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2020-11-06 22:46:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-06 22:46:17,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:17,840 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:17,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:46:17,840 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -540199753, now seen corresponding path program 1 times [2020-11-06 22:46:17,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:17,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102213627] [2020-11-06 22:46:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:46:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:46:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:46:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:46:17,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102213627] [2020-11-06 22:46:17,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:17,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:46:17,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205306688] [2020-11-06 22:46:17,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:46:17,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:46:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:46:17,974 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 8 states. [2020-11-06 22:46:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:18,642 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2020-11-06 22:46:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:46:18,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-11-06 22:46:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:18,645 INFO L225 Difference]: With dead ends: 79 [2020-11-06 22:46:18,645 INFO L226 Difference]: Without dead ends: 70 [2020-11-06 22:46:18,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:46:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-06 22:46:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2020-11-06 22:46:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-06 22:46:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2020-11-06 22:46:18,662 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 34 [2020-11-06 22:46:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:18,662 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2020-11-06 22:46:18,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:46:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2020-11-06 22:46:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-06 22:46:18,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:18,664 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:18,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:46:18,664 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -322214380, now seen corresponding path program 1 times [2020-11-06 22:46:18,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:18,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708802525] [2020-11-06 22:46:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:18,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:18,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:18,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:18,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:46:18,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708802525] [2020-11-06 22:46:18,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:18,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:46:18,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476157494] [2020-11-06 22:46:18,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:46:18,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:18,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:46:18,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:18,800 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 9 states. [2020-11-06 22:46:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:19,470 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2020-11-06 22:46:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:46:19,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-11-06 22:46:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:19,472 INFO L225 Difference]: With dead ends: 81 [2020-11-06 22:46:19,472 INFO L226 Difference]: Without dead ends: 77 [2020-11-06 22:46:19,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:46:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-06 22:46:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2020-11-06 22:46:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-06 22:46:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-11-06 22:46:19,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 36 [2020-11-06 22:46:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:19,490 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-11-06 22:46:19,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:46:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-11-06 22:46:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-06 22:46:19,492 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:19,492 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:19,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:46:19,493 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1730401513, now seen corresponding path program 1 times [2020-11-06 22:46:19,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:19,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474463476] [2020-11-06 22:46:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:46:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:46:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:46:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-06 22:46:19,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474463476] [2020-11-06 22:46:19,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851055364] [2020-11-06 22:46:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:19,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-06 22:46:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:20,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:46:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-06 22:46:20,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:20,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-11-06 22:46:20,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017275425] [2020-11-06 22:46:20,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:46:20,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:46:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:46:20,205 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 16 states. [2020-11-06 22:46:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:21,169 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2020-11-06 22:46:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:46:21,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2020-11-06 22:46:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:21,171 INFO L225 Difference]: With dead ends: 96 [2020-11-06 22:46:21,172 INFO L226 Difference]: Without dead ends: 87 [2020-11-06 22:46:21,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:46:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-06 22:46:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2020-11-06 22:46:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-06 22:46:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2020-11-06 22:46:21,191 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 59 [2020-11-06 22:46:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:21,192 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2020-11-06 22:46:21,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:46:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-11-06 22:46:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-06 22:46:21,196 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:21,197 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:21,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:46:21,413 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash -117784122, now seen corresponding path program 1 times [2020-11-06 22:46:21,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:21,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441982667] [2020-11-06 22:46:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:46:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-06 22:46:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-06 22:46:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-06 22:46:21,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441982667] [2020-11-06 22:46:21,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872911934] [2020-11-06 22:46:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:21,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:46:21,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:21,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:21,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-06 22:46:21,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:21,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-11-06 22:46:21,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906698791] [2020-11-06 22:46:21,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-06 22:46:21,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-06 22:46:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:46:21,932 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 15 states. [2020-11-06 22:46:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:22,625 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-11-06 22:46:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:46:22,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-11-06 22:46:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:22,628 INFO L225 Difference]: With dead ends: 98 [2020-11-06 22:46:22,629 INFO L226 Difference]: Without dead ends: 94 [2020-11-06 22:46:22,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:46:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-06 22:46:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2020-11-06 22:46:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-06 22:46:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2020-11-06 22:46:22,664 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 61 [2020-11-06 22:46:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:22,667 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2020-11-06 22:46:22,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-06 22:46:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2020-11-06 22:46:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-06 22:46:22,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:22,673 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:22,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:22,889 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:22,890 INFO L82 PathProgramCache]: Analyzing trace with hash -588025609, now seen corresponding path program 2 times [2020-11-06 22:46:22,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828158034] [2020-11-06 22:46:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:46:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-06 22:46:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-06 22:46:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-06 22:46:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-06 22:46:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-06 22:46:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:46:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2020-11-06 22:46:23,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828158034] [2020-11-06 22:46:23,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163743339] [2020-11-06 22:46:23,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:23,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:46:23,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:46:23,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-06 22:46:23,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:23,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:46:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-06 22:46:23,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:23,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-11-06 22:46:23,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088918375] [2020-11-06 22:46:23,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-06 22:46:23,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-06 22:46:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:46:23,726 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 20 states. [2020-11-06 22:46:25,421 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-11-06 22:46:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:25,517 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2020-11-06 22:46:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:46:25,518 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2020-11-06 22:46:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:25,521 INFO L225 Difference]: With dead ends: 113 [2020-11-06 22:46:25,521 INFO L226 Difference]: Without dead ends: 96 [2020-11-06 22:46:25,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2020-11-06 22:46:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-06 22:46:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-11-06 22:46:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-06 22:46:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-11-06 22:46:25,543 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 84 [2020-11-06 22:46:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:25,544 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-11-06 22:46:25,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-06 22:46:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-11-06 22:46:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-06 22:46:25,546 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:25,546 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:25,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:25,760 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:25,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash 961778260, now seen corresponding path program 2 times [2020-11-06 22:46:25,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:25,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155556809] [2020-11-06 22:46:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:46:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-06 22:46:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-06 22:46:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-06 22:46:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-11-06 22:46:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-11-06 22:46:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-06 22:46:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2020-11-06 22:46:26,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155556809] [2020-11-06 22:46:26,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582994074] [2020-11-06 22:46:26,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:26,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:46:26,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:46:26,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-06 22:46:26,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:26,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:26,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-11-06 22:46:26,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:26,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-11-06 22:46:26,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946890990] [2020-11-06 22:46:26,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-06 22:46:26,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-06 22:46:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:46:26,569 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 24 states. [2020-11-06 22:46:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:28,339 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2020-11-06 22:46:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-06 22:46:28,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2020-11-06 22:46:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:28,341 INFO L225 Difference]: With dead ends: 97 [2020-11-06 22:46:28,341 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:46:28,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=1459, Unknown=0, NotChecked=0, Total=1806 [2020-11-06 22:46:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:46:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:46:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:46:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:46:28,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2020-11-06 22:46:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:28,348 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:46:28,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-06 22:46:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:46:28,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:46:28,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:28,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:46:29,063 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-11-06 22:46:29,181 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 20 [2020-11-06 22:46:29,298 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 20 [2020-11-06 22:46:29,498 WARN L194 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2020-11-06 22:46:29,646 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-11-06 22:46:29,823 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 30 [2020-11-06 22:46:29,980 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 16 [2020-11-06 22:46:30,187 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 30 [2020-11-06 22:46:30,318 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 16 [2020-11-06 22:46:30,333 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2020-11-06 22:46:30,333 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:30,334 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:30,334 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:46:30,335 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:30,335 INFO L266 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L266 CegarLoopResult]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 24 56) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-11-06 22:46:30,336 INFO L262 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-11-06 22:46:30,336 INFO L266 CegarLoopResult]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L266 CegarLoopResult]: For program point L32(lines 25 56) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L266 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-11-06 22:46:30,336 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse1 (<= 0 main_~buf~0)) (.cse2 (<= 1 main_~in~0))) (or (let ((.cse0 (+ main_~buflim~0 2))) (and (<= main_~bufferlen~0 .cse0) .cse1 (<= 3 main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse2)) (and .cse1 .cse2 (< (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~in~0 2) main_~inlen~0) (<= main_~buf~0 1)) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2020-11-06 22:46:30,337 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (not (= main_~buf~0 main_~buflim~0)) (= main_~in~0 0) (= main_~bufferlen~0 .cse0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse1) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= .cse0 main_~bufferlen~0) (<= 1 main_~in~0) .cse1))) [2020-11-06 22:46:30,337 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (not (= main_~buf~0 main_~buflim~0)) (= main_~in~0 0) (= main_~bufferlen~0 .cse0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse1) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= .cse0 main_~bufferlen~0) (<= 1 main_~in~0) .cse1))) [2020-11-06 22:46:30,337 INFO L266 CegarLoopResult]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2020-11-06 22:46:30,337 INFO L262 CegarLoopResult]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse1 (<= 0 main_~buf~0)) (.cse2 (<= 1 main_~in~0))) (or (let ((.cse0 (+ main_~buflim~0 2))) (and (<= main_~bufferlen~0 .cse0) .cse1 (<= 3 main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse2)) (and .cse1 .cse2 (< (+ main_~buf~0 1) main_~bufferlen~0) (<= (+ main_~in~0 2) main_~inlen~0) (<= main_~buf~0 1)) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2020-11-06 22:46:30,337 INFO L266 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-11-06 22:46:30,337 INFO L266 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-11-06 22:46:30,337 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (< main_~bufferlen~0 main_~inlen~0))) [2020-11-06 22:46:30,338 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (< main_~bufferlen~0 main_~inlen~0))) [2020-11-06 22:46:30,338 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 24 56) no Hoare annotation was computed. [2020-11-06 22:46:30,338 INFO L266 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-11-06 22:46:30,338 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2020-11-06 22:46:30,338 INFO L269 CegarLoopResult]: At program point L55(lines 25 56) the Hoare annotation is: true [2020-11-06 22:46:30,338 INFO L262 CegarLoopResult]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) (= main_~bufferlen~0 .cse0) (< 0 (+ main_~buflim~0 1)) (= main_~buf~0 0) .cse1))) [2020-11-06 22:46:30,338 INFO L266 CegarLoopResult]: For program point L39(lines 39 40) no Hoare annotation was computed. [2020-11-06 22:46:30,338 INFO L266 CegarLoopResult]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2020-11-06 22:46:30,338 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-06 22:46:30,338 INFO L266 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2020-11-06 22:46:30,339 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-06 22:46:30,339 INFO L266 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-11-06 22:46:30,339 INFO L266 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-11-06 22:46:30,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:30 BoogieIcfgContainer [2020-11-06 22:46:30,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:46:30,379 INFO L168 Benchmark]: Toolchain (without parser) took 15634.37 ms. Allocated memory was 167.8 MB in the beginning and 291.5 MB in the end (delta: 123.7 MB). Free memory was 143.0 MB in the beginning and 215.5 MB in the end (delta: -72.5 MB). Peak memory consumption was 134.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:30,381 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory is still 80.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:46:30,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.76 ms. Allocated memory is still 167.8 MB. Free memory was 142.4 MB in the beginning and 132.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:30,384 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 167.8 MB. Free memory was 132.7 MB in the beginning and 131.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:30,387 INFO L168 Benchmark]: RCFGBuilder took 416.17 ms. Allocated memory is still 167.8 MB. Free memory was 131.1 MB in the beginning and 114.7 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:30,390 INFO L168 Benchmark]: TraceAbstraction took 14901.75 ms. Allocated memory was 167.8 MB in the beginning and 291.5 MB in the end (delta: 123.7 MB). Free memory was 114.3 MB in the beginning and 215.5 MB in the end (delta: -101.2 MB). Peak memory consumption was 105.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:30,397 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.22 ms. Allocated memory is still 125.8 MB. Free memory is still 80.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 264.76 ms. Allocated memory is still 167.8 MB. Free memory was 142.4 MB in the beginning and 132.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 167.8 MB. Free memory was 132.7 MB in the beginning and 131.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 416.17 ms. Allocated memory is still 167.8 MB. Free memory was 131.1 MB in the beginning and 114.7 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14901.75 ms. Allocated memory was 167.8 MB in the beginning and 291.5 MB in the end (delta: 123.7 MB). Free memory was 114.3 MB in the beginning and 215.5 MB in the end (delta: -101.2 MB). Peak memory consumption was 105.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((in + bufferlen + 1 <= buf + inlen && bufferlen <= buflim + 2) && 0 <= buf) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen) && 1 <= in) && bufferlen < inlen) || ((((in == 0 && bufferlen == buflim + 2) && 0 < buflim + 1) && buf == 0) && bufferlen < inlen) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 12, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 702 SDslu, 609 SDs, 0 SdLazy, 2154 SolverSat, 848 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 378 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, 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, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 112 PreInvPairs, 154 NumberOfFragments, 436 HoareAnnotationTreeSize, 112 FomulaSimplifications, 3086 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 3643 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 181806 SizeOfPredicates, 14 NumberOfNonLiveVariables, 756 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 1408/1508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...