./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de88212c8693b9f87e164f2a8585947c848ea21 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-21 12:33:39,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:33:39,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:33:39,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:33:39,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:33:39,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:33:39,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:33:39,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:33:39,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:33:39,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:33:39,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:33:39,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:33:39,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:33:39,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:33:39,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:33:39,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:33:39,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:33:39,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:33:39,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:33:39,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:33:39,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:33:39,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:33:39,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:33:39,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:33:39,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:33:39,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:33:39,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:33:39,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:33:39,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:33:39,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:33:39,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:33:39,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:33:39,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:33:39,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:33:39,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:33:39,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:33:39,881 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:33:39,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:33:39,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:33:39,909 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:33:39,909 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:33:39,910 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:33:39,910 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:33:39,910 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:33:39,910 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:33:39,910 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:33:39,911 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:33:39,911 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:33:39,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:33:39,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:33:39,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:33:39,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:33:39,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:33:39,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:33:39,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:33:39,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:33:39,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:33:39,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:33:39,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:33:39,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:33:39,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:33:39,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:33:39,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:33:39,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:33:39,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:33:39,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:33:39,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:33:39,916 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:33:39,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:33:39,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:33:39,916 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:33:39,917 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-10-21 12:33:39,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:33:40,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:33:40,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:33:40,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:33:40,011 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:33:40,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-21 12:33:40,084 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8f392018d/6208f27be08d465d90ad35f4d275aebc/FLAGbae1a52c3 [2018-10-21 12:33:40,528 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:33:40,529 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-21 12:33:40,536 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8f392018d/6208f27be08d465d90ad35f4d275aebc/FLAGbae1a52c3 [2018-10-21 12:33:40,549 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8f392018d/6208f27be08d465d90ad35f4d275aebc [2018-10-21 12:33:40,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:33:40,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:33:40,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:33:40,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:33:40,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:33:40,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70108a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40, skipping insertion in model container [2018-10-21 12:33:40,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:33:40,607 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:33:40,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:33:40,863 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:33:40,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:33:40,924 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:33:40,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40 WrapperNode [2018-10-21 12:33:40,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:33:40,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:33:40,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:33:40,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:33:40,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:33:40,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:33:40,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:33:40,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:33:40,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... [2018-10-21 12:33:40,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:33:40,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:33:40,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:33:40,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:33:40,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:33:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:33:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:33:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:33:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:33:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:33:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:33:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:33:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:33:41,781 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:33:41,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:33:41 BoogieIcfgContainer [2018-10-21 12:33:41,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:33:41,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:33:41,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:33:41,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:33:41,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:33:40" (1/3) ... [2018-10-21 12:33:41,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e6db75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:33:41, skipping insertion in model container [2018-10-21 12:33:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:33:40" (2/3) ... [2018-10-21 12:33:41,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e6db75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:33:41, skipping insertion in model container [2018-10-21 12:33:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:33:41" (3/3) ... [2018-10-21 12:33:41,789 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-21 12:33:41,799 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:33:41,808 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:33:41,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:33:41,861 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:33:41,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:33:41,862 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:33:41,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:33:41,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:33:41,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:33:41,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:33:41,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:33:41,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:33:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-21 12:33:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-21 12:33:41,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:41,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:41,893 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-10-21 12:33:41,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:41,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:41,950 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:42,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:33:42,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:33:42,003 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:33:42,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:33:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:33:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:33:42,022 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-21 12:33:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:33:42,044 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-10-21 12:33:42,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:33:42,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-21 12:33:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:33:42,055 INFO L225 Difference]: With dead ends: 39 [2018-10-21 12:33:42,055 INFO L226 Difference]: Without dead ends: 22 [2018-10-21 12:33:42,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:33:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-21 12:33:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-21 12:33:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-21 12:33:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-10-21 12:33:42,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-10-21 12:33:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:33:42,097 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-10-21 12:33:42,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:33:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-10-21 12:33:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-21 12:33:42,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:42,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:42,099 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:42,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-10-21 12:33:42,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:42,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:42,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:42,102 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:42,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:33:42,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:33:42,219 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:33:42,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:33:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:33:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:42,221 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-10-21 12:33:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:33:42,400 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-10-21 12:33:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:33:42,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-21 12:33:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:33:42,403 INFO L225 Difference]: With dead ends: 30 [2018-10-21 12:33:42,403 INFO L226 Difference]: Without dead ends: 25 [2018-10-21 12:33:42,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-21 12:33:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-21 12:33:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-21 12:33:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-21 12:33:42,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-10-21 12:33:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:33:42,412 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-21 12:33:42,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:33:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-21 12:33:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-21 12:33:42,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:42,413 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:42,413 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:42,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-10-21 12:33:42,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:42,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:42,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:42,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:42,415 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:44,631 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-10-21 12:33:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:44,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:33:44,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:33:44,641 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:33:44,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:33:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:33:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:44,642 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-10-21 12:33:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:33:45,016 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-10-21 12:33:45,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:33:45,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-21 12:33:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:33:45,019 INFO L225 Difference]: With dead ends: 54 [2018-10-21 12:33:45,019 INFO L226 Difference]: Without dead ends: 37 [2018-10-21 12:33:45,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-21 12:33:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-21 12:33:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-21 12:33:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-10-21 12:33:45,027 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-10-21 12:33:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:33:45,027 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-10-21 12:33:45,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:33:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-10-21 12:33:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-21 12:33:45,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:45,029 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:45,029 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:45,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-10-21 12:33:45,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:45,031 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:45,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:33:45,778 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:33:45,779 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-21 12:33:45,781 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-10-21 12:33:45,838 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:33:45,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:33:45,973 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:33:46,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:33:46,934 INFO L272 AbstractInterpreter]: Visited 22 different actions 133 times. Merged at 13 different actions 89 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-21 12:33:46,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:46,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:33:46,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:33:46,987 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:33:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:47,010 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:33:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:47,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:33:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:47,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:33:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:50,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:33:50,094 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:33:50,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:50,111 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:33:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:50,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:33:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:50,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:33:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (3)] Exception during sending of exit command (exit): Broken pipe [2018-10-21 12:33:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:33:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-10-21 12:33:50,195 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:33:50,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:33:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:33:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-21 12:33:50,199 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-10-21 12:33:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:33:50,649 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-10-21 12:33:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-21 12:33:50,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-10-21 12:33:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:33:50,654 INFO L225 Difference]: With dead ends: 54 [2018-10-21 12:33:50,654 INFO L226 Difference]: Without dead ends: 49 [2018-10-21 12:33:50,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-21 12:33:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-21 12:33:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-21 12:33:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-21 12:33:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-10-21 12:33:50,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-10-21 12:33:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:33:50,663 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-10-21 12:33:50,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:33:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-10-21 12:33:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-21 12:33:50,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:50,665 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:50,665 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:50,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-10-21 12:33:50,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:50,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:50,667 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:33:50,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:33:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:33:50,801 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:33:50,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:33:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:33:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:50,802 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-10-21 12:33:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:33:50,877 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-10-21 12:33:50,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:33:50,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-21 12:33:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:33:50,885 INFO L225 Difference]: With dead ends: 66 [2018-10-21 12:33:50,885 INFO L226 Difference]: Without dead ends: 49 [2018-10-21 12:33:50,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:33:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-21 12:33:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-21 12:33:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-21 12:33:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-21 12:33:50,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-10-21 12:33:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:33:50,896 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-21 12:33:50,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:33:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-21 12:33:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-21 12:33:50,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:33:50,897 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:33:50,897 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:33:50,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:33:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-10-21 12:33:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:33:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:33:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:33:50,902 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:33:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:33:53,331 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-10-21 12:33:55,366 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:03,517 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-10-21 12:34:05,534 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:07,578 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:09,616 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-21 12:34:09,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:09,640 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:09,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-21 12:34:09,641 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-10-21 12:34:09,644 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:34:09,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:34:09,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:34:09,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:34:09,731 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-10-21 12:34:09,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:09,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:34:09,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:09,768 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:34:09,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:09,783 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:34:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:09,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:10,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:10,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:10,437 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:34:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:10,453 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:34:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:10,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:10,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6, 10, 7] total 22 [2018-10-21 12:34:11,022 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:11,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-21 12:34:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-21 12:34:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=226, Unknown=7, NotChecked=170, Total=462 [2018-10-21 12:34:11,023 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 17 states. [2018-10-21 12:34:13,224 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-10-21 12:34:15,272 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:17,305 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-21 12:34:25,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-10-21 12:34:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:25,508 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-21 12:34:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-21 12:34:25,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-10-21 12:34:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:25,510 INFO L225 Difference]: With dead ends: 67 [2018-10-21 12:34:25,510 INFO L226 Difference]: Without dead ends: 36 [2018-10-21 12:34:25,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=73, Invalid=258, Unknown=11, NotChecked=360, Total=702 [2018-10-21 12:34:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-21 12:34:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-21 12:34:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-21 12:34:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-21 12:34:25,516 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-10-21 12:34:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:25,516 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-21 12:34:25,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-21 12:34:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-21 12:34:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-21 12:34:25,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:25,518 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:25,518 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:25,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-10-21 12:34:25,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:25,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:25,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:25,520 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:26,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:26,060 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:26,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:26,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:26,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:26,061 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:34:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:34:26,071 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:26,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:34:26,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:26,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:26,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:35,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:35,553 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:34:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:34:35,570 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:35,627 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:34:35,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:35,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:35,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:35,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:35,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23, 23] total 44 [2018-10-21 12:34:35,698 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:35,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-21 12:34:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-21 12:34:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-21 12:34:35,700 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-10-21 12:34:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:36,215 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-21 12:34:36,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-21 12:34:36,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-10-21 12:34:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:36,217 INFO L225 Difference]: With dead ends: 54 [2018-10-21 12:34:36,217 INFO L226 Difference]: Without dead ends: 49 [2018-10-21 12:34:36,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-21 12:34:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-21 12:34:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-21 12:34:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-21 12:34:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-21 12:34:36,226 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-10-21 12:34:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:36,226 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-21 12:34:36,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-21 12:34:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-21 12:34:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-21 12:34:36,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:36,228 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:36,229 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:36,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-10-21 12:34:36,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:36,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:34:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:36,232 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:37,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:37,177 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:37,177 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:37,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:37,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:37,178 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:34:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:34:37,186 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:34:37,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-21 12:34:37,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:37,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:37,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:59,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:59,739 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:34:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:34:59,755 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:34:59,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-21 12:34:59,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:59,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:59,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:59,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:59,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33, 33, 33] total 64 [2018-10-21 12:34:59,922 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:59,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-21 12:34:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-21 12:34:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3011, Unknown=1, NotChecked=0, Total=4032 [2018-10-21 12:34:59,926 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-10-21 12:35:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:00,849 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-21 12:35:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-21 12:35:00,856 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-10-21 12:35:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:00,857 INFO L225 Difference]: With dead ends: 66 [2018-10-21 12:35:00,857 INFO L226 Difference]: Without dead ends: 61 [2018-10-21 12:35:00,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=1020, Invalid=3011, Unknown=1, NotChecked=0, Total=4032 [2018-10-21 12:35:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-21 12:35:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-21 12:35:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-21 12:35:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-21 12:35:00,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-10-21 12:35:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:00,872 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-21 12:35:00,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-21 12:35:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-21 12:35:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-21 12:35:00,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:00,873 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:00,874 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:00,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-10-21 12:35:00,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:00,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:35:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:00,877 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:02,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:02,652 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:35:02,652 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:35:02,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:35:02,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:02,652 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:35:02,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:35:02,663 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-21 12:35:02,716 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:35:02,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:35:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:35:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:02,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:35:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:30,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:35:30,129 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:35:30,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:35:30,148 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-21 12:35:30,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:35:30,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:35:30,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:35:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:30,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:35:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:35:30,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43, 43, 43] total 84 [2018-10-21 12:35:30,322 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:35:30,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-21 12:35:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-21 12:35:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-10-21 12:35:30,325 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-10-21 12:35:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:35:32,143 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-21 12:35:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-21 12:35:32,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-10-21 12:35:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:35:32,146 INFO L225 Difference]: With dead ends: 78 [2018-10-21 12:35:32,146 INFO L226 Difference]: Without dead ends: 73 [2018-10-21 12:35:32,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-10-21 12:35:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-21 12:35:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-21 12:35:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-21 12:35:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-21 12:35:32,157 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-10-21 12:35:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:35:32,157 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-21 12:35:32,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-21 12:35:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-21 12:35:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-21 12:35:32,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:35:32,160 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:35:32,161 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:35:32,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:35:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-10-21 12:35:32,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:35:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:32,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:35:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:35:32,163 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:35:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:35:34,829 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:37,053 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:39,126 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:41,244 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:45,324 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:49,477 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:51,555 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:53,727 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:55,821 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:35:58,020 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:00,213 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:04,593 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:06,719 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:08,988 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:11,130 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:13,462 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:15,707 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:19,857 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:24,136 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:26,274 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:28,406 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:30,545 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:34,717 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:36,990 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:41,479 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:43,633 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:45,861 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:52,029 WARN L179 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:56,357 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:36:58,522 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:37:00,693 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:37:04,905 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-21 12:37:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:37:05,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:37:05,208 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:37:05,209 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:37:05,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:37:05,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:37:05,209 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-21 12:37:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-21 12:37:05,220 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:37:05,491 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-21 12:37:05,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:37:05,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:37:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:37:06,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:37:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-21 12:37:08,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:37:08,498 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:37:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-21 12:37:08,514 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:37:08,688 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-21 12:37:08,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:37:08,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:37:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:37:09,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:37:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-21 12:37:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:37:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6, 55, 7] total 69 [2018-10-21 12:37:10,519 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:37:10,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-21 12:37:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-21 12:37:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=4374, Unknown=0, NotChecked=0, Total=4692 [2018-10-21 12:37:10,524 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 64 states. [2018-10-21 12:37:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:37:13,840 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-21 12:37:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-21 12:37:13,841 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 71 [2018-10-21 12:37:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:37:13,841 INFO L225 Difference]: With dead ends: 87 [2018-10-21 12:37:13,841 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:37:13,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 246 SyntacticMatches, 25 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 96.8s TimeCoverageRelationStatistics Valid=324, Invalid=4506, Unknown=0, NotChecked=0, Total=4830 [2018-10-21 12:37:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:37:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:37:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:37:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:37:13,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-10-21 12:37:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:37:13,845 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:37:13,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-21 12:37:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:37:13,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:37:13,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:37:14,431 WARN L179 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-21 12:37:14,485 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-21 12:37:14,486 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse2 (+ .cse3 main_~x~0 .cse4)) (.cse1 (= (+ .cse3 .cse4) main_~y~0))) (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse1 (<= main_~x~0 20)) (and (<= .cse2 (+ main_~y~0 100)) .cse1 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse1) (and (<= .cse2 (+ main_~y~0 40)) .cse1 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse1))))) [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,486 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (let ((.cse3 (div main_~y~0 2))) (let ((.cse1 (* 2 .cse3)) (.cse2 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (and (<= main_~y~0 (+ .cse1 .cse2)) (<= (+ .cse1 main_~x~0 .cse2) (+ main_~y~0 100)) (<= 100 main_~x~0))))) [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-10-21 12:37:14,487 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-10-21 12:37:14,487 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-21 12:37:14,487 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:37:14,488 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-21 12:37:14,488 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-21 12:37:14,488 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-21 12:37:14,488 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:37:14,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:37:14 BoogieIcfgContainer [2018-10-21 12:37:14,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:37:14,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:37:14,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:37:14,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:37:14,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:33:41" (3/4) ... [2018-10-21 12:37:14,509 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:37:14,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:37:14,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:37:14,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:37:14,521 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-21 12:37:14,521 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-21 12:37:14,521 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-21 12:37:14,578 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:37:14,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:37:14,579 INFO L168 Benchmark]: Toolchain (without parser) took 214022.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 954.5 MB in the beginning and 898.2 MB in the end (delta: 56.3 MB). Peak memory consumption was 327.4 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:14,581 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:14,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.51 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:14,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:14,583 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 938.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:14,583 INFO L168 Benchmark]: RCFGBuilder took 791.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:14,584 INFO L168 Benchmark]: TraceAbstraction took 212722.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 237.3 MB). Peak memory consumption was 347.9 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:14,586 INFO L168 Benchmark]: Witness Printer took 73.39 ms. Allocated memory is still 1.3 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:14,592 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.51 ms. Allocated memory is still 1.0 GB. Free memory was 954.5 MB in the beginning and 943.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 1.0 GB. Free memory is still 943.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 938.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 791.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 938.4 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 212722.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 237.3 MB). Peak memory consumption was 347.9 MB. Max. memory is 11.5 GB. * Witness Printer took 73.39 ms. Allocated memory is still 1.3 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 12]: Loop Invariant Derived loop invariant: (((((((0 <= x + 5 && !(y % 2 == 0)) && x + 5 <= 0) || (x <= 0 && 0 <= x)) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 212.6s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 22.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 2070 SDs, 0 SdLazy, 7671 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1227 GetRequests, 871 SyntacticMatches, 52 SemanticMatches, 304 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 198.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 261 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 447 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 186.4s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1323 ConstructedInterpolants, 24 QuantifiedInterpolants, 895551 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 188/1364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...