java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:53:56,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:53:56,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:53:56,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:53:56,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:53:56,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:53:56,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:53:56,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:53:56,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:53:56,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:53:56,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:53:56,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:53:56,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:53:56,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:53:56,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:53:56,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:53:56,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:53:56,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:53:56,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:53:56,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:53:56,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:53:56,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:53:56,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:53:56,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:53:56,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:53:56,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:53:56,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:53:56,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:53:56,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:53:56,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:53:56,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:53:56,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:53:56,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:53:56,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:53:56,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:53:56,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:53:56,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:53:56,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:53:56,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:53:56,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:53:56,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:53:56,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 12:53:56,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:53:56,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:53:56,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:53:56,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:53:56,877 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:53:56,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:53:56,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:53:56,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:53:56,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:53:56,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:53:56,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:53:56,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:53:56,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:53:56,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:53:56,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:53:56,880 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:53:56,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:53:56,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:53:56,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:53:56,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:53:56,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:53:56,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:53:56,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:53:56,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:53:56,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:53:56,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:53:56,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:53:56,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:53:56,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:53:56,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:53:56,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:53:56,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:53:56,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:53:56,948 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:53:56,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c [2019-09-07 12:53:57,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c399da12/8c460234759543198e8c51f0c8d49270/FLAGfb937792b [2019-09-07 12:53:57,480 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:53:57,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2.c.cil.c [2019-09-07 12:53:57,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c399da12/8c460234759543198e8c51f0c8d49270/FLAGfb937792b [2019-09-07 12:53:57,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c399da12/8c460234759543198e8c51f0c8d49270 [2019-09-07 12:53:57,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:53:57,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:53:57,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:53:57,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:53:57,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:53:57,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:53:57" (1/1) ... [2019-09-07 12:53:57,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52db89b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:57, skipping insertion in model container [2019-09-07 12:53:57,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:53:57" (1/1) ... [2019-09-07 12:53:57,849 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:53:57,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:53:58,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:53:58,111 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:53:58,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:53:58,278 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:53:58,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58 WrapperNode [2019-09-07 12:53:58,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:53:58,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:53:58,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:53:58,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:53:58,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... [2019-09-07 12:53:58,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:53:58,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:53:58,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:53:58,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:53:58,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:53:58,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:53:58,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:53:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 12:53:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2019-09-07 12:53:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2019-09-07 12:53:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2019-09-07 12:53:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:53:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:53:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 12:53:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-07 12:53:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 12:53:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2019-09-07 12:53:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2019-09-07 12:53:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2019-09-07 12:53:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:53:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:53:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:53:58,794 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:53:58,794 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 12:53:58,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:53:58 BoogieIcfgContainer [2019-09-07 12:53:58,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:53:58,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:53:58,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:53:58,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:53:58,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:53:57" (1/3) ... [2019-09-07 12:53:58,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d533620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:53:58, skipping insertion in model container [2019-09-07 12:53:58,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:53:58" (2/3) ... [2019-09-07 12:53:58,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d533620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:53:58, skipping insertion in model container [2019-09-07 12:53:58,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:53:58" (3/3) ... [2019-09-07 12:53:58,804 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2019-09-07 12:53:58,814 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:53:58,820 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:53:58,833 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:53:58,872 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:53:58,873 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:53:58,873 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:53:58,873 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:53:58,873 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:53:58,873 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:53:58,873 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:53:58,873 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:53:58,873 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:53:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-09-07 12:53:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 12:53:58,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:58,899 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-09-07 12:53:58,901 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:58,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1570912407, now seen corresponding path program 1 times [2019-09-07 12:53:58,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:58,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:58,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 12:53:59,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:59,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:53:59,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:53:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:53:59,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:59,154 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-09-07 12:53:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:59,221 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2019-09-07 12:53:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:53:59,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-07 12:53:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:59,234 INFO L225 Difference]: With dead ends: 118 [2019-09-07 12:53:59,235 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 12:53:59,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:53:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 12:53:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-07 12:53:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 12:53:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2019-09-07 12:53:59,285 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2019-09-07 12:53:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:59,287 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2019-09-07 12:53:59,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:53:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2019-09-07 12:53:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:53:59,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:59,291 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-09-07 12:53:59,292 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -880454641, now seen corresponding path program 1 times [2019-09-07 12:53:59,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:59,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:59,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:59,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 12:53:59,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:53:59,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:53:59,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:53:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:53:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:53:59,402 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2019-09-07 12:53:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:53:59,456 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-09-07 12:53:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:53:59,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-07 12:53:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:53:59,462 INFO L225 Difference]: With dead ends: 64 [2019-09-07 12:53:59,462 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 12:53:59,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:53:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 12:53:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-07 12:53:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 12:53:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2019-09-07 12:53:59,479 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2019-09-07 12:53:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:53:59,480 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-09-07 12:53:59,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:53:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2019-09-07 12:53:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 12:53:59,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:53:59,482 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-09-07 12:53:59,482 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:53:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:53:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1901522995, now seen corresponding path program 1 times [2019-09-07 12:53:59,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:53:59,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:53:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:59,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:53:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:53:59,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:53:59,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:53:59,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:53:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:53:59,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 12:53:59,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:53:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:53:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:53:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2019-09-07 12:53:59,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:53:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:53:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:53:59,823 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 9 states. [2019-09-07 12:54:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:00,179 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2019-09-07 12:54:00,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:54:00,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-07 12:54:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:00,187 INFO L225 Difference]: With dead ends: 147 [2019-09-07 12:54:00,187 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 12:54:00,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:54:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 12:54:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2019-09-07 12:54:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 12:54:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2019-09-07 12:54:00,221 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 50 [2019-09-07 12:54:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:00,221 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2019-09-07 12:54:00,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:54:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2019-09-07 12:54:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 12:54:00,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:00,225 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:00,227 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash 922622062, now seen corresponding path program 1 times [2019-09-07 12:54:00,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:00,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:00,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:00,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:00,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:54:00,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 12:54:00,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:54:00,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-07 12:54:00,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:54:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:54:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:54:00,377 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand 4 states. [2019-09-07 12:54:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:00,465 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2019-09-07 12:54:00,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:54:00,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-07 12:54:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:00,467 INFO L225 Difference]: With dead ends: 161 [2019-09-07 12:54:00,468 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 12:54:00,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:54:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 12:54:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-09-07 12:54:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 12:54:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2019-09-07 12:54:00,491 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 55 [2019-09-07 12:54:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:00,491 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2019-09-07 12:54:00,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:54:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2019-09-07 12:54:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 12:54:00,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:00,501 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:00,501 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash 82967328, now seen corresponding path program 1 times [2019-09-07 12:54:00,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:00,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:00,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:00,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:00,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:54:00,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:54:00,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:54:00,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2019-09-07 12:54:00,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:54:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:54:00,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:54:00,638 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 4 states. [2019-09-07 12:54:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:00,725 INFO L93 Difference]: Finished difference Result 175 states and 249 transitions. [2019-09-07 12:54:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:54:00,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-07 12:54:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:00,729 INFO L225 Difference]: With dead ends: 175 [2019-09-07 12:54:00,729 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 12:54:00,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:54:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 12:54:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2019-09-07 12:54:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 12:54:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2019-09-07 12:54:00,769 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 56 [2019-09-07 12:54:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:00,770 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2019-09-07 12:54:00,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:54:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2019-09-07 12:54:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 12:54:00,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:00,775 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:00,775 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -555510436, now seen corresponding path program 1 times [2019-09-07 12:54:00,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:00,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:00,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:00,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:00,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 12:54:00,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 12:54:01,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:54:01,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-07 12:54:01,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:54:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:54:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:54:01,039 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand 9 states. [2019-09-07 12:54:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:01,300 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2019-09-07 12:54:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:54:01,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-07 12:54:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:01,308 INFO L225 Difference]: With dead ends: 185 [2019-09-07 12:54:01,308 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 12:54:01,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:54:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 12:54:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2019-09-07 12:54:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 12:54:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2019-09-07 12:54:01,324 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 56 [2019-09-07 12:54:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:01,324 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2019-09-07 12:54:01,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:54:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2019-09-07 12:54:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 12:54:01,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:01,326 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:01,326 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -635045297, now seen corresponding path program 1 times [2019-09-07 12:54:01,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:01,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:01,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:01,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:01,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 12:54:01,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 12:54:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:01,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 12 [2019-09-07 12:54:01,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:54:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:54:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:54:01,628 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 12 states. [2019-09-07 12:54:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:03,001 INFO L93 Difference]: Finished difference Result 190 states and 258 transitions. [2019-09-07 12:54:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 12:54:03,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-07 12:54:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:03,003 INFO L225 Difference]: With dead ends: 190 [2019-09-07 12:54:03,004 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 12:54:03,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-07 12:54:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 12:54:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 79. [2019-09-07 12:54:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 12:54:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2019-09-07 12:54:03,020 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 57 [2019-09-07 12:54:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:03,020 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2019-09-07 12:54:03,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:54:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2019-09-07 12:54:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 12:54:03,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:03,021 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-09-07 12:54:03,022 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1832602049, now seen corresponding path program 1 times [2019-09-07 12:54:03,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:03,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:03,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:03,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:03,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:54:03,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 12:54:03,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:03,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-07 12:54:03,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:54:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:54:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:54:03,155 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand 5 states. [2019-09-07 12:54:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:03,244 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2019-09-07 12:54:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:54:03,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-07 12:54:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:03,246 INFO L225 Difference]: With dead ends: 157 [2019-09-07 12:54:03,248 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 12:54:03,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:54:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 12:54:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2019-09-07 12:54:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 12:54:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2019-09-07 12:54:03,260 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 58 [2019-09-07 12:54:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:03,261 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2019-09-07 12:54:03,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:54:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2019-09-07 12:54:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 12:54:03,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:03,262 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:03,263 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash 790010142, now seen corresponding path program 1 times [2019-09-07 12:54:03,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:03,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:03,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:03,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 12:54:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:54:03,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:03,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2019-09-07 12:54:03,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:54:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:54:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:54:03,503 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 11 states. [2019-09-07 12:54:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:03,820 INFO L93 Difference]: Finished difference Result 183 states and 241 transitions. [2019-09-07 12:54:03,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:54:03,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-07 12:54:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:03,823 INFO L225 Difference]: With dead ends: 183 [2019-09-07 12:54:03,823 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 12:54:03,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:54:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 12:54:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2019-09-07 12:54:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 12:54:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-09-07 12:54:03,834 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 60 [2019-09-07 12:54:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:03,834 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-09-07 12:54:03,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:54:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-09-07 12:54:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 12:54:03,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:03,836 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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-09-07 12:54:03,836 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1044704215, now seen corresponding path program 1 times [2019-09-07 12:54:03,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:03,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:03,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:03,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:03,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:03,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 12:54:03,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 12:54:03,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:03,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-07 12:54:03,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:54:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:54:03,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:54:03,962 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-09-07 12:54:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:04,048 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2019-09-07 12:54:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:54:04,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-07 12:54:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:04,050 INFO L225 Difference]: With dead ends: 152 [2019-09-07 12:54:04,050 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 12:54:04,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:54:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 12:54:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2019-09-07 12:54:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 12:54:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2019-09-07 12:54:04,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 66 [2019-09-07 12:54:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:04,068 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2019-09-07 12:54:04,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:54:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2019-09-07 12:54:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 12:54:04,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:04,069 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:04,069 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash -618417046, now seen corresponding path program 1 times [2019-09-07 12:54:04,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:04,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:04,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:04,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:04,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:04,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:04,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:04,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 12:54:04,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:54:04,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:04,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2019-09-07 12:54:04,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:54:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:54:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:54:04,372 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand 15 states. [2019-09-07 12:54:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:05,211 INFO L93 Difference]: Finished difference Result 191 states and 248 transitions. [2019-09-07 12:54:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 12:54:05,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-09-07 12:54:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:05,213 INFO L225 Difference]: With dead ends: 191 [2019-09-07 12:54:05,213 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 12:54:05,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2019-09-07 12:54:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 12:54:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2019-09-07 12:54:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-07 12:54:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2019-09-07 12:54:05,232 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 68 [2019-09-07 12:54:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:05,235 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2019-09-07 12:54:05,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 12:54:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2019-09-07 12:54:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 12:54:05,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:05,237 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:05,237 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash -179154886, now seen corresponding path program 1 times [2019-09-07 12:54:05,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:05,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:05,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:05,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:05,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:05,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:05,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:05,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 12:54:05,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:54:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-07 12:54:05,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:54:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:54:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:54:05,376 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 7 states. [2019-09-07 12:54:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:05,484 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2019-09-07 12:54:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:54:05,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-07 12:54:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:05,488 INFO L225 Difference]: With dead ends: 199 [2019-09-07 12:54:05,488 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 12:54:05,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:54:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 12:54:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2019-09-07 12:54:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 12:54:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2019-09-07 12:54:05,502 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 69 [2019-09-07 12:54:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:05,503 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2019-09-07 12:54:05,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:54:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2019-09-07 12:54:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 12:54:05,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:05,505 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:05,505 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1740683077, now seen corresponding path program 1 times [2019-09-07 12:54:05,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:05,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:54:05,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:05,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:05,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:05,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 12:54:05,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 12:54:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-09-07 12:54:05,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 12:54:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 12:54:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:54:05,875 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 16 states. [2019-09-07 12:54:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:09,012 INFO L93 Difference]: Finished difference Result 212 states and 279 transitions. [2019-09-07 12:54:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 12:54:09,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-07 12:54:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:09,014 INFO L225 Difference]: With dead ends: 212 [2019-09-07 12:54:09,014 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 12:54:09,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 12:54:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 12:54:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2019-09-07 12:54:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 12:54:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-09-07 12:54:09,025 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 71 [2019-09-07 12:54:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:09,025 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-09-07 12:54:09,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 12:54:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-09-07 12:54:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 12:54:09,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:09,027 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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] [2019-09-07 12:54:09,027 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 676332152, now seen corresponding path program 2 times [2019-09-07 12:54:09,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:09,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:09,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 12:54:09,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:09,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:09,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:54:09,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:54:09,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 12:54:09,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-07 12:54:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-07 12:54:09,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:54:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:54:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:54:09,184 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 8 states. [2019-09-07 12:54:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:09,270 INFO L93 Difference]: Finished difference Result 163 states and 199 transitions. [2019-09-07 12:54:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:54:09,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-07 12:54:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:09,272 INFO L225 Difference]: With dead ends: 163 [2019-09-07 12:54:09,272 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 12:54:09,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:54:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 12:54:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2019-09-07 12:54:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 12:54:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2019-09-07 12:54:09,281 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 76 [2019-09-07 12:54:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:09,283 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2019-09-07 12:54:09,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:54:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2019-09-07 12:54:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 12:54:09,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:09,284 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2019-09-07 12:54:09,285 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -53562823, now seen corresponding path program 2 times [2019-09-07 12:54:09,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:09,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:54:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 12:54:09,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:09,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:09,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:54:09,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:54:09,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:54:09,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 12:54:09,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-07 12:54:09,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:09,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-09-07 12:54:09,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 12:54:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 12:54:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-07 12:54:09,720 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 17 states. [2019-09-07 12:54:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:10,431 INFO L93 Difference]: Finished difference Result 175 states and 219 transitions. [2019-09-07 12:54:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 12:54:10,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-09-07 12:54:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:10,432 INFO L225 Difference]: With dead ends: 175 [2019-09-07 12:54:10,433 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 12:54:10,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-07 12:54:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 12:54:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2019-09-07 12:54:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 12:54:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2019-09-07 12:54:10,445 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 78 [2019-09-07 12:54:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:10,445 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-09-07 12:54:10,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 12:54:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2019-09-07 12:54:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 12:54:10,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:10,447 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:10,447 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1621523587, now seen corresponding path program 1 times [2019-09-07 12:54:10,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:10,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:10,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:54:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:54:10,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:10,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:10,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:10,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:54:10,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 12:54:10,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:10,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-07 12:54:10,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:54:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:54:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:54:10,611 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 9 states. [2019-09-07 12:54:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:10,695 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2019-09-07 12:54:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:54:10,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-07 12:54:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:10,697 INFO L225 Difference]: With dead ends: 179 [2019-09-07 12:54:10,697 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 12:54:10,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:54:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 12:54:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2019-09-07 12:54:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 12:54:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2019-09-07 12:54:10,707 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 79 [2019-09-07 12:54:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:10,708 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2019-09-07 12:54:10,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:54:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2019-09-07 12:54:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 12:54:10,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:10,710 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:10,710 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2142751612, now seen corresponding path program 1 times [2019-09-07 12:54:10,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:10,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:10,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:54:10,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:10,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:10,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:10,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 12:54:10,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 12:54:11,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:11,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-07 12:54:11,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 12:54:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 12:54:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:54:11,107 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 18 states. [2019-09-07 12:54:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:11,805 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2019-09-07 12:54:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 12:54:11,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-07 12:54:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:11,808 INFO L225 Difference]: With dead ends: 190 [2019-09-07 12:54:11,808 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 12:54:11,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2019-09-07 12:54:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 12:54:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2019-09-07 12:54:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 12:54:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-09-07 12:54:11,816 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 81 [2019-09-07 12:54:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:11,817 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-09-07 12:54:11,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 12:54:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-09-07 12:54:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 12:54:11,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:11,818 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:11,819 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash -947918378, now seen corresponding path program 1 times [2019-09-07 12:54:11,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:11,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:11,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:11,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:54:11,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:11,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:11,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:11,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 12:54:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Stream closed [2019-09-07 12:54:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:11,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-07 12:54:11,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:54:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:54:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:54:11,971 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 10 states. [2019-09-07 12:54:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:12,053 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2019-09-07 12:54:12,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:54:12,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2019-09-07 12:54:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:12,055 INFO L225 Difference]: With dead ends: 189 [2019-09-07 12:54:12,055 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 12:54:12,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:54:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 12:54:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2019-09-07 12:54:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 12:54:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-09-07 12:54:12,065 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 82 [2019-09-07 12:54:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:12,065 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-09-07 12:54:12,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:54:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-09-07 12:54:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 12:54:12,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:54:12,067 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:54:12,067 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:54:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:54:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1461800553, now seen corresponding path program 1 times [2019-09-07 12:54:12,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:54:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:54:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:54:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:54:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 12:54:12,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:54:12,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:54:12,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:54:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:54:12,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 12:54:12,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:54:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 12:54:12,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:54:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-07 12:54:12,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 12:54:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 12:54:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:54:12,512 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 19 states. [2019-09-07 12:54:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:54:13,457 INFO L93 Difference]: Finished difference Result 177 states and 217 transitions. [2019-09-07 12:54:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 12:54:13,458 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-09-07 12:54:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:54:13,458 INFO L225 Difference]: With dead ends: 177 [2019-09-07 12:54:13,458 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 12:54:13,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-09-07 12:54:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 12:54:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 12:54:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 12:54:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 12:54:13,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2019-09-07 12:54:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:54:13,461 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 12:54:13,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 12:54:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 12:54:13,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 12:54:13,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 12:54:13,698 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 52 [2019-09-07 12:54:13,953 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 66 [2019-09-07 12:54:14,470 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 70 [2019-09-07 12:54:14,872 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 54 [2019-09-07 12:54:15,010 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 65 [2019-09-07 12:54:15,654 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-09-07 12:54:16,056 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 22 [2019-09-07 12:54:16,076 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 12:54:16,076 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:54:16,076 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-09-07 12:54:16,077 INFO L443 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-09-07 12:54:16,077 INFO L439 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse0 (<= |base2flt_#in~e| base2flt_~e)) (.cse1 (<= base2flt_~e |base2flt_#in~e|))) (or (and (= 0 base2flt_~__retres4~0) .cse0 (= base2flt_~m |base2flt_#in~m|) .cse1) (or (<= (+ |base2flt_#in~m| 4261412865) 0) (<= 16777216 |base2flt_#in~m|)) (and .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (forall ((base2flt_~m Int)) (or (not (<= |base2flt_#in~m| base2flt_~m)) (not (<= base2flt_~m |base2flt_#in~m|)) (not (<= (mod base2flt_~m 4294967296) 0)))))) [2019-09-07 12:54:16,077 INFO L443 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-09-07 12:54:16,077 INFO L443 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-09-07 12:54:16,077 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-09-07 12:54:16,077 INFO L439 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (and (<= base2flt_~e |base2flt_#in~e|) (forall ((base2flt_~m Int)) (or (not (<= |base2flt_#in~m| base2flt_~m)) (not (<= base2flt_~m |base2flt_#in~m|)) (not (<= (mod base2flt_~m 4294967296) 0))))) [2019-09-07 12:54:16,077 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-09-07 12:54:16,078 INFO L446 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2019-09-07 12:54:16,078 INFO L443 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2019-09-07 12:54:16,078 INFO L439 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (or (let ((.cse1 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse1 1))) (and (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or (<= .cse0 0) (<= (+ (* 4294967296 .cse1) 16777216) |base2flt_#in~m|))))) (forall ((base2flt_~m Int)) (or (not (<= |base2flt_#in~m| base2flt_~m)) (not (<= base2flt_~m |base2flt_#in~m|)) (not (<= (mod base2flt_~m 4294967296) 0))))) [2019-09-07 12:54:16,078 INFO L443 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2019-09-07 12:54:16,078 INFO L439 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse2 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse2 1))) (let ((.cse1 (<= .cse0 0))) (and (<= |base2flt_#in~e| base2flt_~e) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2019-09-07 12:54:16,078 INFO L443 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2019-09-07 12:54:16,078 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-09-07 12:54:16,078 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L446 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-09-07 12:54:16,079 INFO L439 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (= 0 mulflt_~__retres10~1))) (and (let ((.cse2 (mod |mulflt_#in~a| 4294967296))) (or .cse0 (and (exists ((mulflt_~b Int)) (let ((.cse1 (mod mulflt_~b 4294967296))) (and (<= .cse1 (mod |mulflt_#in~a| 4294967296)) (not (= .cse1 0))))) (<= (mod mulflt_~b 4294967296) .cse2) (= mulflt_~a |mulflt_#in~a|)) (and (= mulflt_~b |mulflt_#in~a|) (not (= .cse2 0))))) (or (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296))) (and (= mulflt_~b |mulflt_#in~b|) .cse0)))) [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 12:54:16,080 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-09-07 12:54:16,080 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-09-07 12:54:16,081 INFO L443 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2019-09-07 12:54:16,081 INFO L443 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2019-09-07 12:54:16,081 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2019-09-07 12:54:16,082 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-09-07 12:54:16,082 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-09-07 12:54:16,082 INFO L439 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2019-09-07 12:54:16,082 INFO L443 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2019-09-07 12:54:16,082 INFO L446 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2019-09-07 12:54:16,082 INFO L443 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2019-09-07 12:54:16,082 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2019-09-07 12:54:16,082 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-09-07 12:54:16,083 INFO L439 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~tmp___0~0 0)) [2019-09-07 12:54:16,083 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-09-07 12:54:16,083 INFO L439 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2019-09-07 12:54:16,083 INFO L439 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= 0 main_~zero~0))) (or (and (= main_~b~0 0) .cse0) (and (<= (mod main_~a~0 4294967296) 0) .cse0) (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0)) (<= (+ main_~sa~0 1) 0))) [2019-09-07 12:54:16,083 INFO L443 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2019-09-07 12:54:16,083 INFO L439 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2019-09-07 12:54:16,083 INFO L443 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2019-09-07 12:54:16,083 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point addfltENTRY(lines 73 136) no Hoare annotation was computed. [2019-09-07 12:54:16,084 INFO L443 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2019-09-07 12:54:16,085 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2019-09-07 12:54:16,085 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2019-09-07 12:54:16,085 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-09-07 12:54:16,085 INFO L443 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point L133(lines 83 135) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2019-09-07 12:54:16,086 INFO L443 ceAbstractionStarter]: For program point L115-2(lines 115 126) no Hoare annotation was computed. [2019-09-07 12:54:16,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2019-09-07 12:54:16,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2019-09-07 12:54:16,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 12:54:16 BoogieIcfgContainer [2019-09-07 12:54:16,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 12:54:16,145 INFO L168 Benchmark]: Toolchain (without parser) took 18310.23 ms. Allocated memory was 132.6 MB in the beginning and 409.5 MB in the end (delta: 276.8 MB). Free memory was 88.3 MB in the beginning and 226.1 MB in the end (delta: -137.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,146 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.78 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 175.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,153 INFO L168 Benchmark]: Boogie Preprocessor took 50.71 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 173.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,154 INFO L168 Benchmark]: RCFGBuilder took 465.58 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 149.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,154 INFO L168 Benchmark]: TraceAbstraction took 17346.39 ms. Allocated memory was 199.2 MB in the beginning and 409.5 MB in the end (delta: 210.2 MB). Free memory was 149.3 MB in the beginning and 226.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 254.3 MB. Max. memory is 7.1 GB. [2019-09-07 12:54:16,162 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.78 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 175.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.71 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 173.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.58 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 149.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17346.39 ms. Allocated memory was 199.2 MB in the beginning and 409.5 MB in the end (delta: 210.2 MB). Free memory was 149.3 MB in the beginning and 226.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 254.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2019-09-07 12:54:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((\old(m) <= m || 0 < m / 4294967296 + 1) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) || (forall base2flt_~m : int :: (!(\old(m) <= base2flt_~m) || !(base2flt_~m <= \old(m))) || !(base2flt_~m % 4294967296 <= 0)) - InvariantResult [Line: 18]: Loop Invariant [2019-09-07 12:54:16,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: ((((((0 == __retres4 && \old(e) <= e) && m == \old(m)) && e <= \old(e)) || \old(m) + 4261412865 <= 0 || 16777216 <= \old(m)) || (\old(e) <= e && \old(e) + 128 <= 0)) || (127 <= \old(e) && e <= \old(e))) || (forall base2flt_~m : int :: (!(\old(m) <= base2flt_~m) || !(base2flt_~m <= \old(m))) || !(base2flt_~m % 4294967296 <= 0)) - InvariantResult [Line: 147]: Loop Invariant [2019-09-07 12:54:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2019-09-07 12:54:16,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2019-09-07 12:54:16,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] Derived loop invariant: ((0 == __retres10 || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a))) || (b == \old(a) && !(\old(a) % 4294967296 == 0))) && ((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) || (b == \old(b) && 0 == __retres10)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((\old(e) <= e && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) - InvariantResult [Line: 27]: Loop Invariant [2019-09-07 12:54:16,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2019-09-07 12:54:16,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: e <= \old(e) && (forall base2flt_~m : int :: (!(\old(m) <= base2flt_~m) || !(base2flt_~m <= \old(m))) || !(base2flt_~m % 4294967296 <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 1 error locations. SAFE Result, 17.2s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1165 SDtfs, 871 SDslu, 6991 SDs, 0 SdLazy, 4121 SolverSat, 120 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1401 GetRequests, 1130 SyntacticMatches, 10 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 318 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 377 PreInvPairs, 1188 NumberOfFragments, 274 HoareAnnotationTreeSize, 377 FomulaSimplifications, 46722738 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 18 FomulaSimplificationsInter, 51534 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2390 NumberOfCodeBlocks, 2390 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2354 ConstructedInterpolants, 33 QuantifiedInterpolants, 369328 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3076 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 1065/1786 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...