/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:31,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:31,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:31,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:31,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:31,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:31,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:31,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:31,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:31,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:31,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:31,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:31,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:31,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:31,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:31,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:31,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:31,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:31,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:31,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:31,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:31,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:31,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:31,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:31,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:31,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:31,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:31,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:31,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:31,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:31,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:31,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:31,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:31,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:31,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:31,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:31,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:31,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:31,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:31,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:31,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:31,680 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-11-06 22:51:31,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:31,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:31,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:31,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:31,697 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:31,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:31,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:31,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:31,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:31,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:31,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:31,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:31,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:31,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:31,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:31,699 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:31,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:31,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:31,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:31,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:31,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:31,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:31,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:31,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:31,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:31,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:31,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:31,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:31,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:51:31,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:31,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:31,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:31,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:31,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:31,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47.c [2019-11-06 22:51:32,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25763bf9c/e9956afdf7ad477cb1291efcff8eba2b/FLAG699a66251 [2019-11-06 22:51:32,601 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:32,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label47.c [2019-11-06 22:51:32,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25763bf9c/e9956afdf7ad477cb1291efcff8eba2b/FLAG699a66251 [2019-11-06 22:51:32,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25763bf9c/e9956afdf7ad477cb1291efcff8eba2b [2019-11-06 22:51:32,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:32,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:32,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:32,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:32,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:32,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:32" (1/1) ... [2019-11-06 22:51:32,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62394d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32, skipping insertion in model container [2019-11-06 22:51:32,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:32" (1/1) ... [2019-11-06 22:51:32,925 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:33,005 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:51:33,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:33,630 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:51:33,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:33,866 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:51:33,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33 WrapperNode [2019-11-06 22:51:33,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:33,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:51:33,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:51:33,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:51:33,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:33,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (1/1) ... [2019-11-06 22:51:34,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:51:34,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:51:34,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:51:34,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:51:34,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (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-11-06 22:51:34,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:51:34,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:51:34,108 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:51:34,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:51:34,109 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:51:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:51:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:51:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:51:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:51:34,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:51:34,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:35,890 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:35,893 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:35,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:35 BoogieIcfgContainer [2019-11-06 22:51:35,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:35,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:35,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:35,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:35,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:32" (1/3) ... [2019-11-06 22:51:35,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59566537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:35, skipping insertion in model container [2019-11-06 22:51:35,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:33" (2/3) ... [2019-11-06 22:51:35,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59566537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:35, skipping insertion in model container [2019-11-06 22:51:35,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:35" (3/3) ... [2019-11-06 22:51:35,910 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label47.c [2019-11-06 22:51:35,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:35,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:35,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:35,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:35,981 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:35,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:35,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:35,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:35,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:35,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:35,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:51:36,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:36,014 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-06 22:51:36,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:36,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1824869262, now seen corresponding path program 1 times [2019-11-06 22:51:36,029 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:36,029 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909122055] [2019-11-06 22:51:36,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:36,348 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909122055] [2019-11-06 22:51:36,349 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:36,350 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:51:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838316995] [2019-11-06 22:51:36,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:51:36,358 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:51:36,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:51:36,377 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:51:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:37,625 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:51:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:51:37,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-06 22:51:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:37,658 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:51:37,658 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:51:37,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:51:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:51:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:51:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:51:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-11-06 22:51:37,748 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 39 [2019-11-06 22:51:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:37,748 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-11-06 22:51:37,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:51:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-11-06 22:51:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-06 22:51:37,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:37,755 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2019-11-06 22:51:37,755 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 686981166, now seen corresponding path program 1 times [2019-11-06 22:51:37,756 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:37,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058570820] [2019-11-06 22:51:37,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:38,016 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058570820] [2019-11-06 22:51:38,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:38,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:51:38,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817525560] [2019-11-06 22:51:38,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:51:38,020 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:51:38,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:51:38,020 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-11-06 22:51:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:39,300 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-11-06 22:51:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:39,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-11-06 22:51:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:39,305 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:51:39,305 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 22:51:39,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:51:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 22:51:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-06 22:51:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-06 22:51:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-11-06 22:51:39,355 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 125 [2019-11-06 22:51:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:39,356 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-11-06 22:51:39,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:51:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-11-06 22:51:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-06 22:51:39,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:39,362 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:39,362 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1152023485, now seen corresponding path program 1 times [2019-11-06 22:51:39,364 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:39,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614295143] [2019-11-06 22:51:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:39,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614295143] [2019-11-06 22:51:39,516 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:39,516 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:39,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058470593] [2019-11-06 22:51:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:39,517 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:39,518 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-11-06 22:51:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:41,201 INFO L93 Difference]: Finished difference Result 2220 states and 3292 transitions. [2019-11-06 22:51:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:41,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-06 22:51:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:41,210 INFO L225 Difference]: With dead ends: 2220 [2019-11-06 22:51:41,210 INFO L226 Difference]: Without dead ends: 1664 [2019-11-06 22:51:41,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-06 22:51:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-06 22:51:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-06 22:51:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2287 transitions. [2019-11-06 22:51:41,279 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2287 transitions. Word has length 134 [2019-11-06 22:51:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:41,280 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2287 transitions. [2019-11-06 22:51:41,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2287 transitions. [2019-11-06 22:51:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-06 22:51:41,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:41,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:41,291 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2008848013, now seen corresponding path program 1 times [2019-11-06 22:51:41,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:41,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494879350] [2019-11-06 22:51:41,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:41,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494879350] [2019-11-06 22:51:41,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620896288] [2019-11-06 22:51:41,742 INFO L94 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 [2019-11-06 22:51:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:41,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:51:41,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-06 22:51:42,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:42,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 64 proven. 107 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:42,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:42,714 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-11-06 22:51:42,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719586122] [2019-11-06 22:51:42,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:42,715 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:51:42,717 INFO L87 Difference]: Start difference. First operand 1664 states and 2287 transitions. Second operand 5 states. [2019-11-06 22:51:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:44,080 INFO L93 Difference]: Finished difference Result 3726 states and 5163 transitions. [2019-11-06 22:51:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:51:44,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-11-06 22:51:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:44,092 INFO L225 Difference]: With dead ends: 3726 [2019-11-06 22:51:44,092 INFO L226 Difference]: Without dead ends: 2068 [2019-11-06 22:51:44,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:51:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-11-06 22:51:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1690. [2019-11-06 22:51:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-11-06 22:51:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2313 transitions. [2019-11-06 22:51:44,159 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2313 transitions. Word has length 262 [2019-11-06 22:51:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:44,161 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2313 transitions. [2019-11-06 22:51:44,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2313 transitions. [2019-11-06 22:51:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-06 22:51:44,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:44,169 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:44,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:44,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1769612725, now seen corresponding path program 1 times [2019-11-06 22:51:44,380 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:44,380 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034909231] [2019-11-06 22:51:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 182 proven. 189 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:45,170 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034909231] [2019-11-06 22:51:45,170 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983037158] [2019-11-06 22:51:45,170 INFO L94 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 [2019-11-06 22:51:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:45,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:45,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 289 proven. 53 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-06 22:51:45,596 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 104 proven. 267 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:46,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [500404877] [2019-11-06 22:51:46,192 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 347 [2019-11-06 22:51:46,238 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:46,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:59,556 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:59,559 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 484 root evaluator evaluations with a maximum evaluation depth of 13. Performed 484 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-11-06 22:51:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:59,563 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:05,248 INFO L227 lantSequenceWeakener]: Weakened 343 states. On average, predicates are now at 77.57% of their original sizes. [2019-11-06 22:52:05,248 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:05,332 INFO L553 sIntCurrentIteration]: We unified 345 AI predicates to 345 [2019-11-06 22:52:05,332 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:05,333 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:05,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:52:05,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038754618] [2019-11-06 22:52:05,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:05,335 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:05,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:52:05,336 INFO L87 Difference]: Start difference. First operand 1690 states and 2313 transitions. Second operand 11 states. [2019-11-06 22:52:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:05,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:05,542 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 13946#true or 16737#(or (and (= ~a21~0 6) (<= 0 (+ main_~input~0 2147483648)) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= main_~input~0 2147483647)) (and (<= 0 (+ main_~input~0 2147483648)) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= main_~input~0 2147483647))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) 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-11-06 22:52:05,554 INFO L168 Benchmark]: Toolchain (without parser) took 32648.08 ms. Allocated memory was 144.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 98.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 386.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,555 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 961.27 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 98.2 MB in the beginning and 164.3 MB in the end (delta: -66.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,559 INFO L168 Benchmark]: Boogie Preprocessor took 141.69 ms. Allocated memory is still 203.9 MB. Free memory was 164.3 MB in the beginning and 158.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,567 INFO L168 Benchmark]: RCFGBuilder took 1886.24 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 158.5 MB in the beginning and 152.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,568 INFO L168 Benchmark]: TraceAbstraction took 29652.45 ms. Allocated memory was 234.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 152.6 MB in the beginning and 1.1 GB in the end (delta: -977.6 MB). Peak memory consumption was 349.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:05,574 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.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 961.27 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 98.2 MB in the beginning and 164.3 MB in the end (delta: -66.1 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.69 ms. Allocated memory is still 203.9 MB. Free memory was 164.3 MB in the beginning and 158.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1886.24 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 158.5 MB in the beginning and 152.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29652.45 ms. Allocated memory was 234.9 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 152.6 MB in the beginning and 1.1 GB in the end (delta: -977.6 MB). Peak memory consumption was 349.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 13946#true or 16737#(or (and (= ~a21~0 6) (<= 0 (+ main_~input~0 2147483648)) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= main_~input~0 2147483647)) (and (<= 0 (+ main_~input~0 2147483648)) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= main_~input~0 2147483647))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 13946#true or 16737#(or (and (= ~a21~0 6) (<= 0 (+ main_~input~0 2147483648)) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (<= main_~input~0 2147483647)) (and (<= 0 (+ main_~input~0 2147483648)) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7) (<= main_~input~0 2147483647))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; main_~input~0 = [-2147483648;2147483647]; ~a24~0 = [1;1]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...