/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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:50:46,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:50:46,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:50:46,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:50:46,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:50:46,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:50:46,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:50:46,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:50:46,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:50:46,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:50:46,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:50:46,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:50:46,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:50:46,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:50:46,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:50:46,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:50:46,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:50:46,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:50:46,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:50:46,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:50:46,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:50:46,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:50:46,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:50:46,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:50:46,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:50:46,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:50:46,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:50:46,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:50:46,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:50:46,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:50:46,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:50:46,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:50:46,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:50:46,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:50:46,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:50:46,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:50:46,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:50:46,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:50:46,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:50:46,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:50:46,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:50:46,964 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:50:46,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:50:46,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:50:46,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:50:46,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:50:46,990 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:50:46,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:50:46,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:50:46,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:50:46,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:50:46,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:50:46,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:50:46,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:50:46,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:50:46,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:50:46,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:50:46,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:50:46,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:50:46,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:50:46,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:50:46,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:50:46,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:50:46,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:50:46,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:50:46,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:50:46,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:50:46,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:50:46,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:50:46,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:50:46,996 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:50:47,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:50:47,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:50:47,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:50:47,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:50:47,291 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:50:47,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24.c [2019-11-06 22:50:47,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a473842/b6736e8893614bd191a8603acf6fee60/FLAG73cd72619 [2019-11-06 22:50:47,867 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:50:47,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label24.c [2019-11-06 22:50:47,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a473842/b6736e8893614bd191a8603acf6fee60/FLAG73cd72619 [2019-11-06 22:50:48,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a473842/b6736e8893614bd191a8603acf6fee60 [2019-11-06 22:50:48,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:50:48,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:50:48,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:48,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:50:48,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:50:48,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:48,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5823125d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48, skipping insertion in model container [2019-11-06 22:50:48,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:48,156 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:50:48,214 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:50:48,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:48,839 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:50:48,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:48,984 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:50:48,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48 WrapperNode [2019-11-06 22:50:48,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:48,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:50:48,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:50:48,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:50:49,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (1/1) ... [2019-11-06 22:50:49,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:50:49,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:50:49,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:50:49,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:50:49,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (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:50:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:50:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:50:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:50:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:50:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:50:49,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:50:49,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:50:49,206 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:50:49,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:50:49,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:50:49,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:50:50,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:50:50,655 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:50:50,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:50 BoogieIcfgContainer [2019-11-06 22:50:50,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:50:50,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:50:50,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:50:50,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:50:50,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:48" (1/3) ... [2019-11-06 22:50:50,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f2d38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:50, skipping insertion in model container [2019-11-06 22:50:50,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:48" (2/3) ... [2019-11-06 22:50:50,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f2d38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:50, skipping insertion in model container [2019-11-06 22:50:50,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:50" (3/3) ... [2019-11-06 22:50:50,675 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label24.c [2019-11-06 22:50:50,689 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:50:50,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:50:50,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:50:50,747 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:50:50,748 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:50:50,748 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:50:50,748 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:50:50,748 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:50:50,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:50:50,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:50:50,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:50:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:50:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:50:50,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:50,786 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:50:50,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2116109586, now seen corresponding path program 1 times [2019-11-06 22:50:50,802 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:50,803 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106534582] [2019-11-06 22:50:50,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:51,126 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:50:51,127 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106534582] [2019-11-06 22:50:51,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:51,128 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:50:51,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496684076] [2019-11-06 22:50:51,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:50:51,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:50:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:50:51,160 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:50:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:52,440 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:50:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:50:52,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-06 22:50:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:52,462 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:50:52,463 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:50:52,475 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:50:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:50:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:50:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:50:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-11-06 22:50:52,586 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 47 [2019-11-06 22:50:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:52,588 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-11-06 22:50:52,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:50:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-11-06 22:50:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-06 22:50:52,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:52,603 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, 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] [2019-11-06 22:50:52,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1939521290, now seen corresponding path program 1 times [2019-11-06 22:50:52,604 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:52,605 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611864637] [2019-11-06 22:50:52,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:50:52,842 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611864637] [2019-11-06 22:50:52,842 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:52,842 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:50:52,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799492456] [2019-11-06 22:50:52,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:50:52,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:50:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:50:52,846 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-11-06 22:50:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:54,149 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-11-06 22:50:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:50:54,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-11-06 22:50:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:54,155 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:50:54,155 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 22:50:54,157 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:50:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 22:50:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-06 22:50:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-06 22:50:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-11-06 22:50:54,200 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 121 [2019-11-06 22:50:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:54,201 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-11-06 22:50:54,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:50:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-11-06 22:50:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-06 22:50:54,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:54,208 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, 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] [2019-11-06 22:50:54,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2114473467, now seen corresponding path program 1 times [2019-11-06 22:50:54,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:54,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039263080] [2019-11-06 22:50:54,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:50:54,405 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039263080] [2019-11-06 22:50:54,405 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:54,406 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:50:54,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623987939] [2019-11-06 22:50:54,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:50:54,407 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:50:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:50:54,407 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-11-06 22:50:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:55,966 INFO L93 Difference]: Finished difference Result 2216 states and 3272 transitions. [2019-11-06 22:50:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:50:55,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-06 22:50:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:55,979 INFO L225 Difference]: With dead ends: 2216 [2019-11-06 22:50:55,980 INFO L226 Difference]: Without dead ends: 1660 [2019-11-06 22:50:55,982 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:50:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-11-06 22:50:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1476. [2019-11-06 22:50:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-11-06 22:50:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2051 transitions. [2019-11-06 22:50:56,044 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2051 transitions. Word has length 130 [2019-11-06 22:50:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:56,045 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 2051 transitions. [2019-11-06 22:50:56,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:50:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2051 transitions. [2019-11-06 22:50:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-06 22:50:56,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:56,051 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, 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, 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:50:56,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 511372486, now seen corresponding path program 1 times [2019-11-06 22:50:56,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:56,053 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948267623] [2019-11-06 22:50:56,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 111 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:50:56,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948267623] [2019-11-06 22:50:56,715 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531235805] [2019-11-06 22:50:56,715 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:50:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:56,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:50:56,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:50:56,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-06 22:50:57,109 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:50:57,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:50:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 80 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:50:57,650 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:50:57,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-11-06 22:50:57,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527238887] [2019-11-06 22:50:57,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:50:57,651 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:57,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:50:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:50:57,652 INFO L87 Difference]: Start difference. First operand 1476 states and 2051 transitions. Second operand 5 states. [2019-11-06 22:50:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:59,165 INFO L93 Difference]: Finished difference Result 3352 states and 4662 transitions. [2019-11-06 22:50:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:50:59,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-06 22:50:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:59,178 INFO L225 Difference]: With dead ends: 3352 [2019-11-06 22:50:59,178 INFO L226 Difference]: Without dead ends: 1882 [2019-11-06 22:50:59,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:50:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-11-06 22:50:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1676. [2019-11-06 22:50:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-11-06 22:50:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2166 transitions. [2019-11-06 22:50:59,261 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2166 transitions. Word has length 233 [2019-11-06 22:50:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:59,262 INFO L462 AbstractCegarLoop]: Abstraction has 1676 states and 2166 transitions. [2019-11-06 22:50:59,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:50:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2166 transitions. [2019-11-06 22:50:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-06 22:50:59,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:59,270 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, 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, 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] [2019-11-06 22:50:59,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:50:59,484 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash -266552290, now seen corresponding path program 1 times [2019-11-06 22:50:59,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:59,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673333225] [2019-11-06 22:50:59,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 206 proven. 142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:00,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673333225] [2019-11-06 22:51:00,448 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626439511] [2019-11-06 22:51:00,448 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:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:00,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:00,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:00,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 258 proven. 53 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-06 22:51:00,922 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 220 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:01,554 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [338320189] [2019-11-06 22:51:01,560 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 318 [2019-11-06 22:51:01,622 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:01,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:15,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:15,009 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:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:15,014 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:51:19,412 INFO L227 lantSequenceWeakener]: Weakened 314 states. On average, predicates are now at 77.71% of their original sizes. [2019-11-06 22:51:19,413 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:51:19,491 INFO L553 sIntCurrentIteration]: We unified 316 AI predicates to 316 [2019-11-06 22:51:19,491 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:51:19,492 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:51:19,492 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:51:19,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475663734] [2019-11-06 22:51:19,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:51:19,494 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:51:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:51:19,495 INFO L87 Difference]: Start difference. First operand 1676 states and 2166 transitions. Second operand 11 states. [2019-11-06 22:51:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:51:19,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:19,701 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: 13189#true or 15746#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~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:51:19,709 INFO L168 Benchmark]: Toolchain (without parser) took 31568.78 ms. Allocated memory was 137.9 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:19,714 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.3 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:51:19,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.53 ms. Allocated memory was 137.9 MB in the beginning and 205.5 MB in the end (delta: 67.6 MB). Free memory was 100.1 MB in the beginning and 168.3 MB in the end (delta: -68.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:19,724 INFO L168 Benchmark]: Boogie Preprocessor took 137.70 ms. Allocated memory is still 205.5 MB. Free memory was 168.3 MB in the beginning and 163.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:19,725 INFO L168 Benchmark]: RCFGBuilder took 1536.08 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 163.2 MB in the beginning and 158.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:19,726 INFO L168 Benchmark]: TraceAbstraction took 29046.13 ms. Allocated memory was 238.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 158.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:19,739 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.53 ms. Allocated memory was 137.9 MB in the beginning and 205.5 MB in the end (delta: 67.6 MB). Free memory was 100.1 MB in the beginning and 168.3 MB in the end (delta: -68.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.70 ms. Allocated memory is still 205.5 MB. Free memory was 168.3 MB in the beginning and 163.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1536.08 ms. Allocated memory was 205.5 MB in the beginning and 238.0 MB in the end (delta: 32.5 MB). Free memory was 163.2 MB in the beginning and 158.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29046.13 ms. Allocated memory was 238.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 158.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 32.4 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: 13189#true or 15746#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 13189#true or 15746#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~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...