java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ldv-regression/test27-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:36:34,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:36:34,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:36:34,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:36:34,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:36:34,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:36:34,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:36:34,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:36:34,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:36:34,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:36:34,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:36:34,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:36:34,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:36:34,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:36:34,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:36:34,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:36:34,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:36:34,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:36:34,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:36:34,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:36:34,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:36:34,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:36:34,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:36:34,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:36:34,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:36:34,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:36:34,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:36:34,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:36:34,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:36:34,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:36:34,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:36:34,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:36:34,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:36:34,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:36:34,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:36:34,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:36:34,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:36:34,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:36:34,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:36:34,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:36:34,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:36:34,875 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 [2019-09-08 01:36:34,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:36:34,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:36:34,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:36:34,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:36:34,892 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:36:34,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:36:34,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:36:34,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:36:34,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:36:34,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:36:34,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:36:34,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:36:34,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:36:34,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:36:34,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:36:34,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:36:34,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:36:34,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:36:34,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:36:34,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:36:34,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:36:34,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:36:34,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:36:34,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:36:34,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:36:34,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:36:34,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:36:34,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:36:34,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:36:34,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:36:34,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:36:34,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:36:34,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:36:34,950 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:36:34,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test27-1.c [2019-09-08 01:36:35,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184ba486/3f49decb2afa43f78fc07539d0ef106b/FLAG6b2b56e55 [2019-09-08 01:36:35,515 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:36:35,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test27-1.c [2019-09-08 01:36:35,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184ba486/3f49decb2afa43f78fc07539d0ef106b/FLAG6b2b56e55 [2019-09-08 01:36:35,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f184ba486/3f49decb2afa43f78fc07539d0ef106b [2019-09-08 01:36:35,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:36:35,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:36:35,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:36:35,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:36:35,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:36:35,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:36:35" (1/1) ... [2019-09-08 01:36:35,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b907685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:35, skipping insertion in model container [2019-09-08 01:36:35,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:36:35" (1/1) ... [2019-09-08 01:36:35,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:36:35,896 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:36:36,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:36:36,172 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:36:36,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:36:36,329 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:36:36,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36 WrapperNode [2019-09-08 01:36:36,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:36:36,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:36:36,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:36:36,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:36:36,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (1/1) ... [2019-09-08 01:36:36,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:36:36,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:36:36,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:36:36,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:36:36,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (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 [2019-09-08 01:36:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:36:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:36:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 01:36:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:36:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:36:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:36:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:36:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:36:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:36:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:36:36,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:36:36,844 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:36:36,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:36:36 BoogieIcfgContainer [2019-09-08 01:36:36,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:36:36,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:36:36,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:36:36,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:36:36,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:36:35" (1/3) ... [2019-09-08 01:36:36,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f140dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:36:36, skipping insertion in model container [2019-09-08 01:36:36,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:36:36" (2/3) ... [2019-09-08 01:36:36,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f140dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:36:36, skipping insertion in model container [2019-09-08 01:36:36,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:36:36" (3/3) ... [2019-09-08 01:36:36,854 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-1.c [2019-09-08 01:36:36,861 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:36:36,868 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:36:36,881 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:36:36,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:36:36,910 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:36:36,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:36:36,910 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:36:36,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:36:36,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:36:36,910 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:36:36,911 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:36:36,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:36:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 01:36:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:36:36,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:36,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:36,936 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 63236786, now seen corresponding path program 1 times [2019-09-08 01:36:36,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:36:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:36:37,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:36:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:36:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:36:37,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:36:37,169 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 01:36:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:37,190 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-09-08 01:36:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:36:37,192 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-08 01:36:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:37,202 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:36:37,202 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:36:37,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:36:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:36:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:36:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:36:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 01:36:37,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-08 01:36:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:37,249 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 01:36:37,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:36:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 01:36:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:36:37,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:37,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:37,252 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1428873564, now seen corresponding path program 1 times [2019-09-08 01:36:37,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:37,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:36:37,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:36:37,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:36:37,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:36:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:36:37,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:36:37,342 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-09-08 01:36:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:37,377 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 01:36:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:36:37,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-08 01:36:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:37,380 INFO L225 Difference]: With dead ends: 34 [2019-09-08 01:36:37,380 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:36:37,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:36:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:36:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:36:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:36:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 01:36:37,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-08 01:36:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:37,393 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 01:36:37,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:36:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 01:36:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:36:37,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:37,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:37,395 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2015026266, now seen corresponding path program 1 times [2019-09-08 01:36:37,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:36:37,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:37,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:36:37,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:37,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:36:37,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:36:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:37,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 01:36:37,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:36:37,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:36:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:36:37,609 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-09-08 01:36:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:37,654 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 01:36:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:36:37,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:36:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:37,659 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:36:37,659 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:36:37,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:36:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:36:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:36:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:36:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 01:36:37,665 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-08 01:36:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:37,666 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 01:36:37,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:36:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 01:36:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:36:37,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:37,667 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:37,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1627910184, now seen corresponding path program 2 times [2019-09-08 01:36:37,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:37,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:37,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:36:37,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:37,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:36:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:37,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 01:36:37,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:37,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:36:37,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:37,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:37,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-08 01:36:37,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:37,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:37,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:37,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-08 01:36:38,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 27 [2019-09-08 01:36:38,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:38,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 34 [2019-09-08 01:36:38,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:38,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:256, output treesize:130 [2019-09-08 01:36:38,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:38,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 137 [2019-09-08 01:36:38,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:38,254 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:36:38,303 INFO L567 ElimStorePlain]: treesize reduction 76, result has 45.7 percent of original size [2019-09-08 01:36:38,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2019-09-08 01:36:38,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:38,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:219, output treesize:13 [2019-09-08 01:36:38,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-09-08 01:36:38,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:38,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:38,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-09-08 01:36:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 01:36:38,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:36:38,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 01:36:38,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:36:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:36:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:36:38,391 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-08 01:36:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:38,703 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-08 01:36:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:36:38,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-08 01:36:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:38,705 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:36:38,705 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:36:38,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:36:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:36:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:36:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:36:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 01:36:38,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2019-09-08 01:36:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:38,712 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 01:36:38,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:36:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 01:36:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:36:38,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:38,714 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:38,714 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1609672059, now seen corresponding path program 1 times [2019-09-08 01:36:38,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:38,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:38,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:38,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:38,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:38,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:36:38,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:38,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:38,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:36:38,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:36:38,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:36:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:36:38,862 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-08 01:36:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:38,914 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:36:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:36:38,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-08 01:36:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:38,917 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:36:38,917 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:36:38,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:36:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:36:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:36:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:36:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 01:36:38,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-09-08 01:36:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:38,934 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 01:36:38,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:36:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 01:36:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:36:38,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:38,937 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:38,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:38,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash -338543225, now seen corresponding path program 2 times [2019-09-08 01:36:38,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:38,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:38,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:39,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:39,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:39,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:36:39,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:36:39,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:39,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:36:39,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:39,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:39,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:36:39,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:36:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:36:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:36:39,167 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2019-09-08 01:36:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:39,212 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-08 01:36:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:36:39,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-08 01:36:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:39,215 INFO L225 Difference]: With dead ends: 46 [2019-09-08 01:36:39,215 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:36:39,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:36:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:36:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 01:36:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:36:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 01:36:39,237 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-09-08 01:36:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:39,239 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 01:36:39,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:36:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 01:36:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:36:39,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:39,241 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:39,241 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:39,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1445554185, now seen corresponding path program 3 times [2019-09-08 01:36:39,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:39,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:39,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:39,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:39,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:39,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:36:39,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:39,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 01:36:39,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:39,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:36:39,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:39,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-09-08 01:36:39,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-09-08 01:36:39,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 27 [2019-09-08 01:36:39,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 34 [2019-09-08 01:36:39,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:256, output treesize:130 [2019-09-08 01:36:39,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 137 [2019-09-08 01:36:39,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:39,728 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:36:39,765 INFO L567 ElimStorePlain]: treesize reduction 76, result has 45.7 percent of original size [2019-09-08 01:36:39,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2019-09-08 01:36:39,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:219, output treesize:13 [2019-09-08 01:36:39,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-09-08 01:36:39,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:39,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:39,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-09-08 01:36:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 01:36:39,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:39,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-08 01:36:39,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:36:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:36:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:36:39,878 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2019-09-08 01:36:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:40,296 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-09-08 01:36:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:36:40,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-08 01:36:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:40,298 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:36:40,298 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:36:40,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:36:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:36:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 01:36:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:36:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 01:36:40,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-09-08 01:36:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:40,305 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 01:36:40,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:36:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 01:36:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:36:40,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:40,307 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:40,307 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -695813082, now seen corresponding path program 4 times [2019-09-08 01:36:40,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:40,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:36:40,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:40,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:36:40,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:36:40,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:40,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:36:40,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:40,624 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 01:36:40,624 INFO L341 Elim1Store]: treesize reduction 28, result has 77.2 percent of original size [2019-09-08 01:36:40,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 102 [2019-09-08 01:36:40,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:40,815 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 01:36:40,815 INFO L567 ElimStorePlain]: treesize reduction 42, result has 84.6 percent of original size [2019-09-08 01:36:40,936 INFO L341 Elim1Store]: treesize reduction 28, result has 78.8 percent of original size [2019-09-08 01:36:40,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 113 [2019-09-08 01:36:40,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:41,072 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 01:36:41,072 INFO L567 ElimStorePlain]: treesize reduction 46, result has 81.7 percent of original size [2019-09-08 01:36:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:36:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:36:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2019-09-08 01:36:41,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:241, output treesize:1017 [2019-09-08 01:36:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,545 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 32 [2019-09-08 01:36:41,587 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:41,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 125 [2019-09-08 01:36:41,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:41,603 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 01:36:41,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:41,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:41,850 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 01:36:41,857 INFO L168 Benchmark]: Toolchain (without parser) took 5998.33 ms. Allocated memory was 137.4 MB in the beginning and 251.1 MB in the end (delta: 113.8 MB). Free memory was 93.7 MB in the beginning and 108.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,858 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.4 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.39 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 93.3 MB in the beginning and 177.9 MB in the end (delta: -84.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,859 INFO L168 Benchmark]: Boogie Preprocessor took 50.75 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,860 INFO L168 Benchmark]: RCFGBuilder took 464.16 ms. Allocated memory is still 200.8 MB. Free memory was 175.3 MB in the beginning and 155.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,861 INFO L168 Benchmark]: TraceAbstraction took 5007.99 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 155.8 MB in the beginning and 108.2 MB in the end (delta: 47.7 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:41,865 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 137.4 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 471.39 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 93.3 MB in the beginning and 177.9 MB in the end (delta: -84.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.75 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 175.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.16 ms. Allocated memory is still 200.8 MB. Free memory was 175.3 MB in the beginning and 155.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5007.99 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 155.8 MB in the beginning and 108.2 MB in the end (delta: 47.7 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...