./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17da727b994aaa75d870178ca09f053b93a70f18 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 06:14:41,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 06:14:41,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 06:14:41,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 06:14:41,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 06:14:41,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 06:14:41,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 06:14:41,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 06:14:41,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 06:14:41,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 06:14:41,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 06:14:41,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 06:14:41,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 06:14:41,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 06:14:41,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 06:14:41,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 06:14:41,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 06:14:41,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 06:14:41,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 06:14:41,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 06:14:41,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 06:14:41,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 06:14:41,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 06:14:41,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 06:14:41,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 06:14:41,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 06:14:41,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 06:14:41,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 06:14:41,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 06:14:41,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 06:14:41,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 06:14:41,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 06:14:41,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 06:14:41,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 06:14:41,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 06:14:41,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 06:14:41,875 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 06:14:41,903 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 06:14:41,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 06:14:41,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 06:14:41,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 06:14:41,905 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 06:14:41,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 06:14:41,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 06:14:41,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 06:14:41,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 06:14:41,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 06:14:41,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 06:14:41,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 06:14:41,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 06:14:41,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 06:14:41,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 06:14:41,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 06:14:41,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 06:14:41,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 06:14:41,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 06:14:41,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 06:14:41,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 06:14:41,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:14:41,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 06:14:41,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 06:14:41,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 06:14:41,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 06:14:41,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 06:14:41,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 06:14:41,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/UAutomizer-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 -> Automizer 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 -> 17da727b994aaa75d870178ca09f053b93a70f18 [2018-12-31 06:14:41,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 06:14:41,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 06:14:41,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 06:14:41,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 06:14:41,990 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 06:14:41,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-12-31 06:14:42,060 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3348471a/8c5d74edd0e748699d41c332065db934/FLAG1d695db9e [2018-12-31 06:14:42,539 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 06:14:42,540 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-12-31 06:14:42,546 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3348471a/8c5d74edd0e748699d41c332065db934/FLAG1d695db9e [2018-12-31 06:14:42,896 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3348471a/8c5d74edd0e748699d41c332065db934 [2018-12-31 06:14:42,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 06:14:42,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 06:14:42,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 06:14:42,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 06:14:42,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 06:14:42,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:14:42" (1/1) ... [2018-12-31 06:14:42,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be2223f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:42, skipping insertion in model container [2018-12-31 06:14:42,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:14:42" (1/1) ... [2018-12-31 06:14:42,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 06:14:42,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 06:14:43,143 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:14:43,149 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 06:14:43,175 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:14:43,188 INFO L195 MainTranslator]: Completed translation [2018-12-31 06:14:43,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43 WrapperNode [2018-12-31 06:14:43,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 06:14:43,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 06:14:43,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 06:14:43,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 06:14:43,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 06:14:43,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 06:14:43,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 06:14:43,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 06:14:43,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... [2018-12-31 06:14:43,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 06:14:43,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 06:14:43,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 06:14:43,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 06:14:43,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:14:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 06:14:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 06:14:43,840 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 06:14:43,840 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 06:14:43,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:14:43 BoogieIcfgContainer [2018-12-31 06:14:43,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 06:14:43,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 06:14:43,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 06:14:43,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 06:14:43,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:14:42" (1/3) ... [2018-12-31 06:14:43,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bc70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:14:43, skipping insertion in model container [2018-12-31 06:14:43,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:14:43" (2/3) ... [2018-12-31 06:14:43,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bc70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:14:43, skipping insertion in model container [2018-12-31 06:14:43,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:14:43" (3/3) ... [2018-12-31 06:14:43,849 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2018-12-31 06:14:43,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 06:14:43,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 06:14:43,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 06:14:43,915 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 06:14:43,916 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 06:14:43,916 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 06:14:43,916 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 06:14:43,917 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 06:14:43,917 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 06:14:43,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 06:14:43,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 06:14:43,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 06:14:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 06:14:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:43,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:43,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:43,948 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1745867070, now seen corresponding path program 1 times [2018-12-31 06:14:43,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:43,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:44,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:44,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:14:44,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:14:44,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:14:44,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:44,147 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-12-31 06:14:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:44,431 INFO L93 Difference]: Finished difference Result 52 states and 90 transitions. [2018-12-31 06:14:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:14:44,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 06:14:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:44,446 INFO L225 Difference]: With dead ends: 52 [2018-12-31 06:14:44,448 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 06:14:44,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 06:14:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 06:14:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 06:14:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-12-31 06:14:44,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2018-12-31 06:14:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:44,493 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-31 06:14:44,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:14:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-12-31 06:14:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:44,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:44,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:44,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash -936932661, now seen corresponding path program 1 times [2018-12-31 06:14:44,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:44,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:44,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:44,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 06:14:44,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 06:14:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 06:14:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 06:14:44,584 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2018-12-31 06:14:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:44,874 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2018-12-31 06:14:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 06:14:44,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-31 06:14:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:44,876 INFO L225 Difference]: With dead ends: 44 [2018-12-31 06:14:44,876 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 06:14:44,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 06:14:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 06:14:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 06:14:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 06:14:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 06:14:44,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 23 [2018-12-31 06:14:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:44,884 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 06:14:44,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 06:14:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 06:14:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:44,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:44,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:44,886 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2008089875, now seen corresponding path program 1 times [2018-12-31 06:14:44,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:14:44,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:14:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:14:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:44,954 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2018-12-31 06:14:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:45,182 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2018-12-31 06:14:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:14:45,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 06:14:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:45,184 INFO L225 Difference]: With dead ends: 54 [2018-12-31 06:14:45,184 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 06:14:45,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 06:14:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 06:14:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 06:14:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-12-31 06:14:45,195 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2018-12-31 06:14:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:45,196 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-12-31 06:14:45,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:14:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-12-31 06:14:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:45,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:45,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:45,198 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:45,198 INFO L82 PathProgramCache]: Analyzing trace with hash 635511084, now seen corresponding path program 1 times [2018-12-31 06:14:45,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:45,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:45,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:45,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:14:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:14:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:14:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:14:45,308 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 6 states. [2018-12-31 06:14:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:45,463 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-12-31 06:14:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:14:45,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-31 06:14:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:45,465 INFO L225 Difference]: With dead ends: 52 [2018-12-31 06:14:45,465 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 06:14:45,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:14:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 06:14:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 06:14:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 06:14:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-31 06:14:45,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2018-12-31 06:14:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:45,472 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-31 06:14:45,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:14:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-31 06:14:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:45,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:45,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:45,474 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash 602818777, now seen corresponding path program 1 times [2018-12-31 06:14:45,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:45,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:45,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:45,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:45,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:45,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:45,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 06:14:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 06:14:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 06:14:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:14:45,908 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2018-12-31 06:14:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:46,124 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-12-31 06:14:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:14:46,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-31 06:14:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:46,127 INFO L225 Difference]: With dead ends: 44 [2018-12-31 06:14:46,127 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 06:14:46,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:14:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 06:14:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-31 06:14:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 06:14:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-12-31 06:14:46,133 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2018-12-31 06:14:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:46,133 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-12-31 06:14:46,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 06:14:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-12-31 06:14:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:46,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:46,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:46,134 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -218545361, now seen corresponding path program 1 times [2018-12-31 06:14:46,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:46,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:46,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:46,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:46,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:46,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:14:46,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:14:46,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:14:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:46,176 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-12-31 06:14:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:46,277 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-31 06:14:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:14:46,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-31 06:14:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:46,280 INFO L225 Difference]: With dead ends: 34 [2018-12-31 06:14:46,280 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 06:14:46,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:14:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 06:14:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-31 06:14:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 06:14:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-31 06:14:46,286 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2018-12-31 06:14:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:46,287 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-31 06:14:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:14:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-31 06:14:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:14:46,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:46,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:46,288 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -217919750, now seen corresponding path program 1 times [2018-12-31 06:14:46,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:46,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:46,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 06:14:46,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 06:14:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 06:14:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:14:46,414 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 11 states. [2018-12-31 06:14:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:46,597 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-31 06:14:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 06:14:46,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-31 06:14:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:46,603 INFO L225 Difference]: With dead ends: 36 [2018-12-31 06:14:46,603 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 06:14:46,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:14:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 06:14:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-31 06:14:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 06:14:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-31 06:14:46,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2018-12-31 06:14:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:46,608 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-31 06:14:46,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 06:14:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-31 06:14:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 06:14:46,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:46,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:46,610 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 423767145, now seen corresponding path program 1 times [2018-12-31 06:14:46,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:46,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:14:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 06:14:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 06:14:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 06:14:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:14:46,912 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 12 states. [2018-12-31 06:14:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:47,130 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-31 06:14:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 06:14:47,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-12-31 06:14:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:47,132 INFO L225 Difference]: With dead ends: 34 [2018-12-31 06:14:47,132 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 06:14:47,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:14:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 06:14:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 06:14:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 06:14:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-31 06:14:47,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2018-12-31 06:14:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:47,139 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-31 06:14:47,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 06:14:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-31 06:14:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 06:14:47,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:47,140 INFO L402 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, 1, 1, 1, 1] [2018-12-31 06:14:47,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -875092666, now seen corresponding path program 1 times [2018-12-31 06:14:47,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:47,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:47,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:47,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:47,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:47,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:47,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:47,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-31 06:14:47,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 06:14:47,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 06:14:47,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 06:14:47,441 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 13 states. [2018-12-31 06:14:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:48,169 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-31 06:14:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 06:14:48,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-12-31 06:14:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:48,173 INFO L225 Difference]: With dead ends: 36 [2018-12-31 06:14:48,174 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 06:14:48,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 06:14:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 06:14:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-31 06:14:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 06:14:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-31 06:14:48,183 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-12-31 06:14:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:48,183 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-31 06:14:48,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 06:14:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-31 06:14:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 06:14:48,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:48,185 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:48,186 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 756112099, now seen corresponding path program 2 times [2018-12-31 06:14:48,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:48,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:48,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:48,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:14:48,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:14:48,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:48,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:48,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:48,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-12-31 06:14:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 06:14:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 06:14:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 06:14:48,598 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 14 states. [2018-12-31 06:14:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:48,713 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-31 06:14:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 06:14:48,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-12-31 06:14:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:48,714 INFO L225 Difference]: With dead ends: 38 [2018-12-31 06:14:48,715 INFO L226 Difference]: Without dead ends: 33 [2018-12-31 06:14:48,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-31 06:14:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-31 06:14:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-31 06:14:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 06:14:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-31 06:14:48,721 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2018-12-31 06:14:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:48,721 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-31 06:14:48,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 06:14:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-31 06:14:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 06:14:48,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:48,722 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:48,722 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash 680828224, now seen corresponding path program 3 times [2018-12-31 06:14:48,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:48,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:48,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:48,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:48,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:14:48,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:48,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:14:49,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 06:14:49,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:49,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 06:14:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2018-12-31 06:14:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 06:14:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 06:14:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-31 06:14:49,132 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-31 06:14:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:49,283 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-12-31 06:14:49,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 06:14:49,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-31 06:14:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:49,287 INFO L225 Difference]: With dead ends: 42 [2018-12-31 06:14:49,287 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 06:14:49,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-31 06:14:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 06:14:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-31 06:14:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 06:14:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-31 06:14:49,292 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2018-12-31 06:14:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:49,293 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-31 06:14:49,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 06:14:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-31 06:14:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 06:14:49,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:49,294 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:49,294 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:49,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2124419607, now seen corresponding path program 4 times [2018-12-31 06:14:49,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:49,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:49,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:49,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:14:49,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:49,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:14:49,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:14:49,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:49,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:14:49,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:49,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-12-31 06:14:49,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 06:14:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 06:14:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-31 06:14:49,558 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-12-31 06:14:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:49,765 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-31 06:14:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 06:14:49,766 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-31 06:14:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:49,767 INFO L225 Difference]: With dead ends: 44 [2018-12-31 06:14:49,767 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 06:14:49,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-31 06:14:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 06:14:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 06:14:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 06:14:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-31 06:14:49,772 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2018-12-31 06:14:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:49,772 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-31 06:14:49,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 06:14:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-31 06:14:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 06:14:49,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:49,774 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:49,774 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:49,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:49,774 INFO L82 PathProgramCache]: Analyzing trace with hash 516774580, now seen corresponding path program 5 times [2018-12-31 06:14:49,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:49,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:14:49,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:49,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:50,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:14:50,023 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-31 06:14:50,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:50,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 06:14:50,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:50,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2018-12-31 06:14:50,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 06:14:50,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 06:14:50,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-31 06:14:50,161 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 21 states. [2018-12-31 06:14:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:50,529 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-31 06:14:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 06:14:50,529 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-12-31 06:14:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:50,531 INFO L225 Difference]: With dead ends: 51 [2018-12-31 06:14:50,531 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 06:14:50,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-31 06:14:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 06:14:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-31 06:14:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 06:14:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-31 06:14:50,537 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 37 [2018-12-31 06:14:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:50,538 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-31 06:14:50,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 06:14:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-31 06:14:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 06:14:50,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:50,539 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:50,539 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2055346949, now seen corresponding path program 6 times [2018-12-31 06:14:50,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:50,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:14:50,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:50,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:50,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:14:50,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-12-31 06:14:50,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:50,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:14:50,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-12-31 06:14:50,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 06:14:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 06:14:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 06:14:50,855 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 18 states. [2018-12-31 06:14:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:51,185 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-31 06:14:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 06:14:51,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-12-31 06:14:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:51,188 INFO L225 Difference]: With dead ends: 56 [2018-12-31 06:14:51,188 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 06:14:51,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-31 06:14:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 06:14:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-31 06:14:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 06:14:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-31 06:14:51,194 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2018-12-31 06:14:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:51,195 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-31 06:14:51,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 06:14:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-31 06:14:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 06:14:51,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:51,197 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:51,197 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -891324766, now seen corresponding path program 7 times [2018-12-31 06:14:51,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:51,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:51,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:51,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:14:51,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:51,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:51,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:14:51,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-12-31 06:14:51,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 06:14:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 06:14:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-31 06:14:51,792 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 19 states. [2018-12-31 06:14:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:51,942 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-31 06:14:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 06:14:51,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-12-31 06:14:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:51,945 INFO L225 Difference]: With dead ends: 58 [2018-12-31 06:14:51,945 INFO L226 Difference]: Without dead ends: 48 [2018-12-31 06:14:51,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-31 06:14:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-31 06:14:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-31 06:14:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-31 06:14:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-31 06:14:51,953 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-31 06:14:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:51,954 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-31 06:14:51,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 06:14:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-31 06:14:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 06:14:51,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:51,955 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:51,955 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2035572479, now seen corresponding path program 8 times [2018-12-31 06:14:51,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:51,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:51,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:51,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:14:52,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:52,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:52,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:14:52,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:14:52,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-31 06:14:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2018-12-31 06:14:52,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-31 06:14:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-31 06:14:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-31 06:14:52,566 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 26 states. [2018-12-31 06:14:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:53,222 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-31 06:14:53,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 06:14:53,223 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-12-31 06:14:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:53,224 INFO L225 Difference]: With dead ends: 65 [2018-12-31 06:14:53,224 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 06:14:53,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-31 06:14:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 06:14:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-31 06:14:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-31 06:14:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-31 06:14:53,232 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2018-12-31 06:14:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:53,232 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-31 06:14:53,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-31 06:14:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-31 06:14:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 06:14:53,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:53,237 INFO L402 BasicCegarLoop]: trace histogram [15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:53,238 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:53,238 INFO L82 PathProgramCache]: Analyzing trace with hash 512283024, now seen corresponding path program 9 times [2018-12-31 06:14:53,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:53,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-31 06:14:53,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:53,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:14:53,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-31 06:14:53,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:53,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-12-31 06:14:53,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:53,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-12-31 06:14:53,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-31 06:14:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-31 06:14:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-31 06:14:53,928 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2018-12-31 06:14:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:54,210 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-31 06:14:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 06:14:54,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-12-31 06:14:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:54,212 INFO L225 Difference]: With dead ends: 73 [2018-12-31 06:14:54,212 INFO L226 Difference]: Without dead ends: 59 [2018-12-31 06:14:54,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-31 06:14:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-31 06:14:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-31 06:14:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 06:14:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-31 06:14:54,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-12-31 06:14:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:54,218 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-31 06:14:54,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-31 06:14:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-31 06:14:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 06:14:54,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:54,219 INFO L402 BasicCegarLoop]: trace histogram [17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:54,219 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:54,219 INFO L82 PathProgramCache]: Analyzing trace with hash 632258215, now seen corresponding path program 10 times [2018-12-31 06:14:54,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:54,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:54,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 143 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 06:14:54,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:54,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:54,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:14:54,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:14:54,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:54,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 143 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 06:14:54,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-12-31 06:14:54,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 06:14:54,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 06:14:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-31 06:14:54,682 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2018-12-31 06:14:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:55,121 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-12-31 06:14:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 06:14:55,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-31 06:14:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:55,123 INFO L225 Difference]: With dead ends: 76 [2018-12-31 06:14:55,123 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 06:14:55,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-31 06:14:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 06:14:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-31 06:14:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 06:14:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-31 06:14:55,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-31 06:14:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:55,132 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-31 06:14:55,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 06:14:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-31 06:14:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-31 06:14:55,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:55,134 INFO L402 BasicCegarLoop]: trace histogram [18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:55,134 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 698467204, now seen corresponding path program 11 times [2018-12-31 06:14:55,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:55,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:55,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 06:14:55,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:55,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:14:55,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-12-31 06:14:55,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:55,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-31 06:14:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 32 [2018-12-31 06:14:55,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-31 06:14:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-31 06:14:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-31 06:14:55,823 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 32 states. [2018-12-31 06:14:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:56,002 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-31 06:14:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-31 06:14:56,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-31 06:14:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:56,004 INFO L225 Difference]: With dead ends: 83 [2018-12-31 06:14:56,004 INFO L226 Difference]: Without dead ends: 67 [2018-12-31 06:14:56,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-31 06:14:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-31 06:14:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-31 06:14:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 06:14:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-31 06:14:56,014 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 59 [2018-12-31 06:14:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:56,015 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-31 06:14:56,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-31 06:14:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-31 06:14:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 06:14:56,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:56,016 INFO L402 BasicCegarLoop]: trace histogram [21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:56,016 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 486303765, now seen corresponding path program 12 times [2018-12-31 06:14:56,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:56,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:56,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 221 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:56,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:56,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:14:56,509 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-12-31 06:14:56,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:56,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 221 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:56,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-12-31 06:14:56,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-31 06:14:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-31 06:14:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-31 06:14:56,554 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 24 states. [2018-12-31 06:14:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:56,735 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-12-31 06:14:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 06:14:56,736 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-12-31 06:14:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:56,738 INFO L225 Difference]: With dead ends: 88 [2018-12-31 06:14:56,738 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 06:14:56,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-31 06:14:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 06:14:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-31 06:14:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-31 06:14:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-31 06:14:56,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2018-12-31 06:14:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:56,746 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-31 06:14:56,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-31 06:14:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-31 06:14:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 06:14:56,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:56,747 INFO L402 BasicCegarLoop]: trace histogram [22, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:56,747 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 998146034, now seen corresponding path program 13 times [2018-12-31 06:14:56,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:56,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 238 proven. 182 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:57,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:57,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:57,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:57,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 238 proven. 182 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-12-31 06:14:57,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 06:14:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 06:14:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-31 06:14:57,455 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2018-12-31 06:14:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:57,638 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-31 06:14:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 06:14:57,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-12-31 06:14:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:57,640 INFO L225 Difference]: With dead ends: 90 [2018-12-31 06:14:57,641 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 06:14:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-31 06:14:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 06:14:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-31 06:14:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 06:14:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-31 06:14:57,646 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2018-12-31 06:14:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:57,646 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-31 06:14:57,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 06:14:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-31 06:14:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 06:14:57,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:57,651 INFO L402 BasicCegarLoop]: trace histogram [23, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:57,651 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1042672497, now seen corresponding path program 14 times [2018-12-31 06:14:57,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:57,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:14:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 255 proven. 210 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:58,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:58,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:58,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:14:58,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:14:58,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:58,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:14:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 255 proven. 210 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:59,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:14:59,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-12-31 06:14:59,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-31 06:14:59,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-31 06:14:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-31 06:14:59,010 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2018-12-31 06:14:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:14:59,226 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-31 06:14:59,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 06:14:59,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-12-31 06:14:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:14:59,228 INFO L225 Difference]: With dead ends: 92 [2018-12-31 06:14:59,228 INFO L226 Difference]: Without dead ends: 72 [2018-12-31 06:14:59,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-31 06:14:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-31 06:14:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-31 06:14:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-31 06:14:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-31 06:14:59,234 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-31 06:14:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:14:59,234 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-31 06:14:59,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-31 06:14:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-31 06:14:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 06:14:59,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:14:59,235 INFO L402 BasicCegarLoop]: trace histogram [24, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:14:59,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:14:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:14:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash 530773484, now seen corresponding path program 15 times [2018-12-31 06:14:59,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:14:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:14:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:59,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:14:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:14:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:14:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 06:14:59,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:14:59,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:14:59,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:14:59,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-31 06:14:59,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:14:59,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 285 proven. 81 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-31 06:15:00,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:00,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12] total 37 [2018-12-31 06:15:00,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-31 06:15:00,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-31 06:15:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 06:15:00,468 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2018-12-31 06:15:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:00,677 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-31 06:15:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-31 06:15:00,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-12-31 06:15:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:00,679 INFO L225 Difference]: With dead ends: 97 [2018-12-31 06:15:00,680 INFO L226 Difference]: Without dead ends: 77 [2018-12-31 06:15:00,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 06:15:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-31 06:15:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-31 06:15:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 06:15:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-31 06:15:00,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2018-12-31 06:15:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:00,686 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-31 06:15:00,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-31 06:15:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-31 06:15:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 06:15:00,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:00,687 INFO L402 BasicCegarLoop]: trace histogram [26, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:00,687 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1675169475, now seen corresponding path program 16 times [2018-12-31 06:15:00,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:00,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:00,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 06:15:01,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:01,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:15:01,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:15:01,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:01,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 06:15:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-12-31 06:15:01,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-31 06:15:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-31 06:15:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-31 06:15:01,181 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2018-12-31 06:15:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:01,354 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-31 06:15:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 06:15:01,355 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2018-12-31 06:15:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:01,356 INFO L225 Difference]: With dead ends: 100 [2018-12-31 06:15:01,356 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 06:15:01,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-31 06:15:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 06:15:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-31 06:15:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 06:15:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-31 06:15:01,361 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-31 06:15:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:01,361 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-31 06:15:01,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-31 06:15:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-31 06:15:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 06:15:01,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:01,362 INFO L402 BasicCegarLoop]: trace histogram [27, 17, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:01,366 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -581388704, now seen corresponding path program 17 times [2018-12-31 06:15:01,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:01,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-31 06:15:01,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:01,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:15:01,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-12-31 06:15:01,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:01,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 169 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-31 06:15:02,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:02,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 43 [2018-12-31 06:15:02,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-31 06:15:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-31 06:15:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:02,369 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 43 states. [2018-12-31 06:15:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:02,590 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-12-31 06:15:02,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-31 06:15:02,591 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 77 [2018-12-31 06:15:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:02,592 INFO L225 Difference]: With dead ends: 111 [2018-12-31 06:15:02,592 INFO L226 Difference]: Without dead ends: 89 [2018-12-31 06:15:02,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-31 06:15:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-31 06:15:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-31 06:15:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-31 06:15:02,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2018-12-31 06:15:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:02,598 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-31 06:15:02,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-31 06:15:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-31 06:15:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 06:15:02,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:02,601 INFO L402 BasicCegarLoop]: trace histogram [32, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:02,601 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash -467322203, now seen corresponding path program 18 times [2018-12-31 06:15:02,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:02,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:02,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-31 06:15:03,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:03,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:03,373 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:15:03,411 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-12-31 06:15:03,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:03,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 527 proven. 225 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-31 06:15:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 46 [2018-12-31 06:15:04,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-31 06:15:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-31 06:15:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 06:15:04,272 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 46 states. [2018-12-31 06:15:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:04,559 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-31 06:15:04,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-31 06:15:04,561 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2018-12-31 06:15:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:04,562 INFO L225 Difference]: With dead ends: 125 [2018-12-31 06:15:04,563 INFO L226 Difference]: Without dead ends: 95 [2018-12-31 06:15:04,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 06:15:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-31 06:15:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-31 06:15:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 06:15:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-31 06:15:04,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2018-12-31 06:15:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:04,570 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-31 06:15:04,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-31 06:15:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-31 06:15:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 06:15:04,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:04,574 INFO L402 BasicCegarLoop]: trace histogram [35, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:04,574 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1219770058, now seen corresponding path program 19 times [2018-12-31 06:15:04,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:04,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:04,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:04,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:04,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 620 proven. 380 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-31 06:15:05,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:05,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:05,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 620 proven. 380 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-31 06:15:05,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:05,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-31 06:15:05,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-31 06:15:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-31 06:15:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-31 06:15:05,094 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2018-12-31 06:15:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:05,248 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-12-31 06:15:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-31 06:15:05,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-12-31 06:15:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:05,250 INFO L225 Difference]: With dead ends: 130 [2018-12-31 06:15:05,251 INFO L226 Difference]: Without dead ends: 96 [2018-12-31 06:15:05,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-31 06:15:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-31 06:15:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-31 06:15:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-31 06:15:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-31 06:15:05,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-31 06:15:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:05,258 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-31 06:15:05,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-31 06:15:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-31 06:15:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 06:15:05,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:05,259 INFO L402 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:05,259 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:05,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:05,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1236425837, now seen corresponding path program 20 times [2018-12-31 06:15:05,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:05,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:05,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 651 proven. 420 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-31 06:15:05,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:05,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:15:05,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:15:05,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:05,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 651 proven. 420 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-31 06:15:05,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:05,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-12-31 06:15:05,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-31 06:15:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-31 06:15:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-31 06:15:05,773 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 32 states. [2018-12-31 06:15:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:05,938 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-31 06:15:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-31 06:15:05,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-12-31 06:15:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:05,941 INFO L225 Difference]: With dead ends: 132 [2018-12-31 06:15:05,941 INFO L226 Difference]: Without dead ends: 98 [2018-12-31 06:15:05,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-31 06:15:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-31 06:15:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-31 06:15:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-31 06:15:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-12-31 06:15:05,946 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2018-12-31 06:15:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:05,948 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-12-31 06:15:05,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-31 06:15:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-12-31 06:15:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 06:15:05,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:05,949 INFO L402 BasicCegarLoop]: trace histogram [37, 21, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:05,949 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -62760272, now seen corresponding path program 21 times [2018-12-31 06:15:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:05,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 682 proven. 462 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-31 06:15:06,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:06,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:15:06,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-31 06:15:06,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:06,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 693 proven. 256 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-12-31 06:15:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2018-12-31 06:15:07,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-31 06:15:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-31 06:15:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 06:15:07,127 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2018-12-31 06:15:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:07,781 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-12-31 06:15:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-31 06:15:07,783 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-12-31 06:15:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:07,784 INFO L225 Difference]: With dead ends: 137 [2018-12-31 06:15:07,784 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 06:15:07,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 06:15:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 06:15:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-31 06:15:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-31 06:15:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-31 06:15:07,792 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2018-12-31 06:15:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:07,793 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-31 06:15:07,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-31 06:15:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-31 06:15:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-31 06:15:07,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:07,793 INFO L402 BasicCegarLoop]: trace histogram [39, 22, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:07,794 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash 889014343, now seen corresponding path program 22 times [2018-12-31 06:15:07,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:07,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:07,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 759 proven. 506 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-31 06:15:08,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:08,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:08,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:15:08,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:15:08,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:08,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 759 proven. 506 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-31 06:15:08,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:08,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-12-31 06:15:08,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-31 06:15:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-31 06:15:08,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 06:15:08,583 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2018-12-31 06:15:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:08,816 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-12-31 06:15:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 06:15:08,817 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-12-31 06:15:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:08,818 INFO L225 Difference]: With dead ends: 140 [2018-12-31 06:15:08,818 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 06:15:08,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 06:15:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 06:15:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 06:15:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 06:15:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-31 06:15:08,825 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2018-12-31 06:15:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:08,826 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-31 06:15:08,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-31 06:15:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-31 06:15:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-31 06:15:08,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:08,826 INFO L402 BasicCegarLoop]: trace histogram [40, 23, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:08,830 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:08,830 INFO L82 PathProgramCache]: Analyzing trace with hash -966691420, now seen corresponding path program 23 times [2018-12-31 06:15:08,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:08,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:08,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 792 proven. 552 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-31 06:15:09,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:09,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:09,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:15:09,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-12-31 06:15:09,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:09,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 819 proven. 361 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-12-31 06:15:10,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:10,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 55 [2018-12-31 06:15:10,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-31 06:15:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-31 06:15:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-31 06:15:10,194 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 55 states. [2018-12-31 06:15:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:10,651 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-12-31 06:15:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-31 06:15:10,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2018-12-31 06:15:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:10,654 INFO L225 Difference]: With dead ends: 149 [2018-12-31 06:15:10,654 INFO L226 Difference]: Without dead ends: 113 [2018-12-31 06:15:10,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-31 06:15:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-31 06:15:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-31 06:15:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-31 06:15:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-31 06:15:10,660 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 103 [2018-12-31 06:15:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:10,661 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-31 06:15:10,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-31 06:15:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-31 06:15:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-31 06:15:10,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:10,664 INFO L402 BasicCegarLoop]: trace histogram [44, 24, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:10,664 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 97170031, now seen corresponding path program 24 times [2018-12-31 06:15:10,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:10,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 975 proven. 600 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-12-31 06:15:11,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:11,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:15:11,376 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-12-31 06:15:11,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:11,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 989 proven. 441 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-31 06:15:12,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:12,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 24] total 58 [2018-12-31 06:15:12,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-31 06:15:12,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-31 06:15:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-31 06:15:12,146 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 58 states. [2018-12-31 06:15:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:12,403 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-31 06:15:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-31 06:15:12,404 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 111 [2018-12-31 06:15:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:12,405 INFO L225 Difference]: With dead ends: 161 [2018-12-31 06:15:12,406 INFO L226 Difference]: Without dead ends: 119 [2018-12-31 06:15:12,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-31 06:15:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-31 06:15:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-31 06:15:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-31 06:15:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-31 06:15:12,413 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2018-12-31 06:15:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-31 06:15:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-31 06:15:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-31 06:15:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 06:15:12,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:12,414 INFO L402 BasicCegarLoop]: trace histogram [47, 25, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:12,415 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1144748800, now seen corresponding path program 25 times [2018-12-31 06:15:12,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:12,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1118 proven. 650 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-12-31 06:15:13,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:13,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:13,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1118 proven. 650 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-12-31 06:15:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-12-31 06:15:13,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-31 06:15:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-31 06:15:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 06:15:13,154 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 37 states. [2018-12-31 06:15:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:13,343 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-12-31 06:15:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-31 06:15:13,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2018-12-31 06:15:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:13,346 INFO L225 Difference]: With dead ends: 166 [2018-12-31 06:15:13,346 INFO L226 Difference]: Without dead ends: 120 [2018-12-31 06:15:13,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 06:15:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-31 06:15:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-31 06:15:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-31 06:15:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-31 06:15:13,353 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-31 06:15:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:13,353 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-31 06:15:13,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-31 06:15:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-31 06:15:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-31 06:15:13,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:13,354 INFO L402 BasicCegarLoop]: trace histogram [48, 26, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:13,354 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash 786716765, now seen corresponding path program 26 times [2018-12-31 06:15:13,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:13,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:13,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:13,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1161 proven. 702 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-12-31 06:15:14,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:14,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:14,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:15:14,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:15:14,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:14,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1161 proven. 702 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-12-31 06:15:14,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:14,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-12-31 06:15:14,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-31 06:15:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-31 06:15:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 06:15:14,465 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 38 states. [2018-12-31 06:15:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:14,663 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-31 06:15:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-31 06:15:14,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2018-12-31 06:15:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:14,665 INFO L225 Difference]: With dead ends: 168 [2018-12-31 06:15:14,666 INFO L226 Difference]: Without dead ends: 122 [2018-12-31 06:15:14,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 06:15:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-31 06:15:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-31 06:15:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-31 06:15:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-12-31 06:15:14,673 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 119 [2018-12-31 06:15:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:14,673 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-12-31 06:15:14,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-31 06:15:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-12-31 06:15:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-31 06:15:14,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:14,677 INFO L402 BasicCegarLoop]: trace histogram [49, 27, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:14,678 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1499252858, now seen corresponding path program 27 times [2018-12-31 06:15:14,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:14,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:14,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1204 proven. 756 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-12-31 06:15:15,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:15,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:15,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:15:15,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-31 06:15:15,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:15,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1215 proven. 484 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-12-31 06:15:16,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:16,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 25] total 62 [2018-12-31 06:15:16,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-31 06:15:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-31 06:15:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-31 06:15:16,308 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 62 states. [2018-12-31 06:15:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:17,443 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-12-31 06:15:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-31 06:15:17,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2018-12-31 06:15:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:17,446 INFO L225 Difference]: With dead ends: 173 [2018-12-31 06:15:17,446 INFO L226 Difference]: Without dead ends: 127 [2018-12-31 06:15:17,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-31 06:15:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-31 06:15:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-12-31 06:15:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-31 06:15:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-31 06:15:17,453 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 121 [2018-12-31 06:15:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:17,453 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-31 06:15:17,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-31 06:15:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-31 06:15:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-31 06:15:17,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:17,454 INFO L402 BasicCegarLoop]: trace histogram [51, 28, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:17,455 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash -818764655, now seen corresponding path program 28 times [2018-12-31 06:15:17,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:17,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1305 proven. 812 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-12-31 06:15:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:18,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:15:18,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:15:18,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:18,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1305 proven. 812 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-12-31 06:15:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-12-31 06:15:18,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-31 06:15:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-31 06:15:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 06:15:18,545 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 40 states. [2018-12-31 06:15:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:18,765 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-12-31 06:15:18,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-31 06:15:18,767 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 125 [2018-12-31 06:15:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:18,768 INFO L225 Difference]: With dead ends: 176 [2018-12-31 06:15:18,769 INFO L226 Difference]: Without dead ends: 128 [2018-12-31 06:15:18,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 06:15:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-31 06:15:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-31 06:15:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 06:15:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-12-31 06:15:18,775 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2018-12-31 06:15:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:18,775 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-12-31 06:15:18,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-31 06:15:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-12-31 06:15:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-31 06:15:18,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:18,776 INFO L402 BasicCegarLoop]: trace histogram [52, 29, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:18,776 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -139736338, now seen corresponding path program 29 times [2018-12-31 06:15:18,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:18,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:18,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:18,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:18,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1350 proven. 870 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-12-31 06:15:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:20,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:20,597 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:15:20,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2018-12-31 06:15:20,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:20,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1377 proven. 625 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-12-31 06:15:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 28] total 67 [2018-12-31 06:15:21,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-31 06:15:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-31 06:15:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-31 06:15:21,676 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 67 states. [2018-12-31 06:15:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:21,968 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-12-31 06:15:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-31 06:15:21,970 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 127 [2018-12-31 06:15:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:21,971 INFO L225 Difference]: With dead ends: 185 [2018-12-31 06:15:21,972 INFO L226 Difference]: Without dead ends: 137 [2018-12-31 06:15:21,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-31 06:15:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-31 06:15:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-31 06:15:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-31 06:15:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-31 06:15:21,979 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 127 [2018-12-31 06:15:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:21,979 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-31 06:15:21,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-31 06:15:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-31 06:15:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-31 06:15:21,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:21,980 INFO L402 BasicCegarLoop]: trace histogram [56, 30, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:21,981 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 651845945, now seen corresponding path program 30 times [2018-12-31 06:15:21,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:21,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:21,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1581 proven. 930 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-12-31 06:15:22,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:22,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:22,717 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:15:22,798 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-12-31 06:15:22,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:22,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1595 proven. 729 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-31 06:15:23,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:23,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 70 [2018-12-31 06:15:23,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-31 06:15:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-31 06:15:23,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-31 06:15:23,968 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 70 states. [2018-12-31 06:15:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:24,389 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-12-31 06:15:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-31 06:15:24,390 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 135 [2018-12-31 06:15:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:24,391 INFO L225 Difference]: With dead ends: 197 [2018-12-31 06:15:24,392 INFO L226 Difference]: Without dead ends: 143 [2018-12-31 06:15:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-31 06:15:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-31 06:15:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-31 06:15:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-31 06:15:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-31 06:15:24,397 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 135 [2018-12-31 06:15:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:24,398 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-31 06:15:24,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-31 06:15:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-31 06:15:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-31 06:15:24,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:24,399 INFO L402 BasicCegarLoop]: trace histogram [59, 31, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:24,399 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1792604106, now seen corresponding path program 31 times [2018-12-31 06:15:24,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:24,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:24,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:24,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1760 proven. 992 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-31 06:15:25,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:25,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:25,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1760 proven. 992 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-31 06:15:25,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:25,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-12-31 06:15:25,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-31 06:15:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-31 06:15:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:25,317 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 43 states. [2018-12-31 06:15:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:25,602 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-31 06:15:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-31 06:15:25,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 141 [2018-12-31 06:15:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:25,606 INFO L225 Difference]: With dead ends: 202 [2018-12-31 06:15:25,606 INFO L226 Difference]: Without dead ends: 144 [2018-12-31 06:15:25,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-31 06:15:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-31 06:15:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-31 06:15:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-31 06:15:25,613 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-31 06:15:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:25,613 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-31 06:15:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-31 06:15:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-31 06:15:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-31 06:15:25,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:25,614 INFO L402 BasicCegarLoop]: trace histogram [60, 32, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:25,614 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:25,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 100385831, now seen corresponding path program 32 times [2018-12-31 06:15:25,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:25,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:25,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1815 proven. 1056 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-31 06:15:27,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:27,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:15:27,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:15:27,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:27,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1815 proven. 1056 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-31 06:15:27,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:27,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-12-31 06:15:27,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-31 06:15:27,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-31 06:15:27,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-31 06:15:27,187 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 44 states. [2018-12-31 06:15:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:27,477 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-12-31 06:15:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-31 06:15:27,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2018-12-31 06:15:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:27,480 INFO L225 Difference]: With dead ends: 204 [2018-12-31 06:15:27,480 INFO L226 Difference]: Without dead ends: 146 [2018-12-31 06:15:27,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-31 06:15:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-31 06:15:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-31 06:15:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 06:15:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-12-31 06:15:27,487 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 143 [2018-12-31 06:15:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-12-31 06:15:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-31 06:15:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-12-31 06:15:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-31 06:15:27,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:27,492 INFO L402 BasicCegarLoop]: trace histogram [61, 33, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:27,493 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:27,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1671228740, now seen corresponding path program 33 times [2018-12-31 06:15:27,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:27,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:27,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1870 proven. 1122 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-12-31 06:15:28,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:28,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:28,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:15:28,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-31 06:15:28,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:28,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1881 proven. 784 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-12-31 06:15:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 31] total 74 [2018-12-31 06:15:30,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-31 06:15:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-31 06:15:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-31 06:15:30,037 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 74 states. [2018-12-31 06:15:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:30,398 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2018-12-31 06:15:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-31 06:15:30,400 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2018-12-31 06:15:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:30,401 INFO L225 Difference]: With dead ends: 209 [2018-12-31 06:15:30,402 INFO L226 Difference]: Without dead ends: 151 [2018-12-31 06:15:30,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-31 06:15:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-31 06:15:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-12-31 06:15:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-31 06:15:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-31 06:15:30,407 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 145 [2018-12-31 06:15:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-31 06:15:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-31 06:15:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-31 06:15:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-31 06:15:30,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:30,409 INFO L402 BasicCegarLoop]: trace histogram [63, 34, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:30,409 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -668928037, now seen corresponding path program 34 times [2018-12-31 06:15:30,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:30,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1995 proven. 1190 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-12-31 06:15:31,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:31,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:15:31,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:15:31,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:31,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1995 proven. 1190 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-12-31 06:15:31,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:31,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-12-31 06:15:31,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-31 06:15:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-31 06:15:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 06:15:31,492 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 46 states. [2018-12-31 06:15:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:31,701 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-31 06:15:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-31 06:15:31,702 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 149 [2018-12-31 06:15:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:31,704 INFO L225 Difference]: With dead ends: 212 [2018-12-31 06:15:31,704 INFO L226 Difference]: Without dead ends: 152 [2018-12-31 06:15:31,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 06:15:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-31 06:15:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-31 06:15:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 06:15:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-12-31 06:15:31,712 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2018-12-31 06:15:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:31,715 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-12-31 06:15:31,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-31 06:15:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-12-31 06:15:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-31 06:15:31,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:31,718 INFO L402 BasicCegarLoop]: trace histogram [64, 35, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:31,718 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1768679624, now seen corresponding path program 35 times [2018-12-31 06:15:31,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:31,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2052 proven. 1260 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2018-12-31 06:15:32,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:32,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:32,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:15:33,010 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2018-12-31 06:15:33,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:33,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2079 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-12-31 06:15:34,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:34,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 34] total 79 [2018-12-31 06:15:34,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-31 06:15:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-31 06:15:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-31 06:15:34,684 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 79 states. [2018-12-31 06:15:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:35,183 INFO L93 Difference]: Finished difference Result 221 states and 226 transitions. [2018-12-31 06:15:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-31 06:15:35,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-31 06:15:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:35,186 INFO L225 Difference]: With dead ends: 221 [2018-12-31 06:15:35,187 INFO L226 Difference]: Without dead ends: 161 [2018-12-31 06:15:35,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-31 06:15:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-31 06:15:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-31 06:15:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-31 06:15:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-31 06:15:35,193 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 151 [2018-12-31 06:15:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:35,194 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-31 06:15:35,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-31 06:15:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-31 06:15:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-31 06:15:35,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:35,195 INFO L402 BasicCegarLoop]: trace histogram [68, 36, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:35,195 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1193818365, now seen corresponding path program 36 times [2018-12-31 06:15:35,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:35,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:35,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2331 proven. 1332 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-12-31 06:15:36,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:36,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:15:36,639 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-12-31 06:15:36,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:36,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1089 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-31 06:15:38,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:38,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 36] total 82 [2018-12-31 06:15:38,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-31 06:15:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-31 06:15:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-31 06:15:38,643 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 82 states. [2018-12-31 06:15:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:39,048 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-12-31 06:15:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-31 06:15:39,050 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 159 [2018-12-31 06:15:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:39,053 INFO L225 Difference]: With dead ends: 233 [2018-12-31 06:15:39,053 INFO L226 Difference]: Without dead ends: 167 [2018-12-31 06:15:39,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-31 06:15:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-31 06:15:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-31 06:15:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-31 06:15:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-31 06:15:39,064 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 159 [2018-12-31 06:15:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:39,064 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-31 06:15:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-31 06:15:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-31 06:15:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-31 06:15:39,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:39,069 INFO L402 BasicCegarLoop]: trace histogram [71, 37, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:39,069 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash -380853868, now seen corresponding path program 37 times [2018-12-31 06:15:39,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:39,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2546 proven. 1406 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-31 06:15:40,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:40,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:40,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2546 proven. 1406 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-31 06:15:40,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-12-31 06:15:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-31 06:15:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-31 06:15:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-31 06:15:40,605 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 49 states. [2018-12-31 06:15:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:41,061 INFO L93 Difference]: Finished difference Result 238 states and 240 transitions. [2018-12-31 06:15:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-31 06:15:41,063 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 165 [2018-12-31 06:15:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:41,065 INFO L225 Difference]: With dead ends: 238 [2018-12-31 06:15:41,065 INFO L226 Difference]: Without dead ends: 168 [2018-12-31 06:15:41,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-31 06:15:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-31 06:15:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-31 06:15:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-31 06:15:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-31 06:15:41,071 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-31 06:15:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:41,071 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-31 06:15:41,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-31 06:15:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-31 06:15:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-31 06:15:41,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:41,072 INFO L402 BasicCegarLoop]: trace histogram [72, 38, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:41,072 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1096247025, now seen corresponding path program 38 times [2018-12-31 06:15:41,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:41,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:41,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2613 proven. 1482 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-31 06:15:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:42,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:15:42,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:15:42,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:42,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2613 proven. 1482 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-31 06:15:42,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:42,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-12-31 06:15:42,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-31 06:15:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-31 06:15:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 06:15:42,905 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 50 states. [2018-12-31 06:15:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:43,123 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2018-12-31 06:15:43,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-31 06:15:43,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 167 [2018-12-31 06:15:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:43,126 INFO L225 Difference]: With dead ends: 240 [2018-12-31 06:15:43,127 INFO L226 Difference]: Without dead ends: 170 [2018-12-31 06:15:43,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-31 06:15:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-31 06:15:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-31 06:15:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-31 06:15:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-12-31 06:15:43,133 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2018-12-31 06:15:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:43,133 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-12-31 06:15:43,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-31 06:15:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-12-31 06:15:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-31 06:15:43,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:43,135 INFO L402 BasicCegarLoop]: trace histogram [73, 39, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:43,135 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1043969778, now seen corresponding path program 39 times [2018-12-31 06:15:43,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:43,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2680 proven. 1560 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-31 06:15:44,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:44,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:15:44,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-31 06:15:44,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:44,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2691 proven. 1156 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 37] total 86 [2018-12-31 06:15:46,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-31 06:15:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-31 06:15:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-31 06:15:46,620 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 86 states. [2018-12-31 06:15:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:47,043 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2018-12-31 06:15:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-31 06:15:47,045 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2018-12-31 06:15:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:47,046 INFO L225 Difference]: With dead ends: 245 [2018-12-31 06:15:47,047 INFO L226 Difference]: Without dead ends: 175 [2018-12-31 06:15:47,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-31 06:15:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-31 06:15:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-12-31 06:15:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-31 06:15:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-31 06:15:47,054 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 169 [2018-12-31 06:15:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:47,056 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-31 06:15:47,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-31 06:15:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-31 06:15:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-31 06:15:47,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:47,057 INFO L402 BasicCegarLoop]: trace histogram [75, 40, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:47,057 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1957413413, now seen corresponding path program 40 times [2018-12-31 06:15:47,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:47,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1640 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-12-31 06:15:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:48,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:15:48,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:15:48,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:48,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1640 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-12-31 06:15:48,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:48,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-12-31 06:15:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-31 06:15:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-31 06:15:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 06:15:48,370 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 52 states. [2018-12-31 06:15:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:48,611 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-12-31 06:15:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-31 06:15:48,613 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 173 [2018-12-31 06:15:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:48,615 INFO L225 Difference]: With dead ends: 248 [2018-12-31 06:15:48,615 INFO L226 Difference]: Without dead ends: 176 [2018-12-31 06:15:48,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 06:15:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-31 06:15:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-31 06:15:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-31 06:15:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-12-31 06:15:48,622 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2018-12-31 06:15:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:48,622 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-12-31 06:15:48,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-31 06:15:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-12-31 06:15:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-31 06:15:48,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:48,624 INFO L402 BasicCegarLoop]: trace histogram [76, 41, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:48,624 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1459758462, now seen corresponding path program 41 times [2018-12-31 06:15:48,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:48,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2925 proven. 1369 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:49,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:49,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:49,325 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 06:15:49,423 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2018-12-31 06:15:49,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:49,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2925 proven. 1369 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-12-31 06:15:49,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-31 06:15:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-31 06:15:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 06:15:49,475 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 40 states. [2018-12-31 06:15:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:49,665 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-12-31 06:15:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-31 06:15:49,666 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 175 [2018-12-31 06:15:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:49,667 INFO L225 Difference]: With dead ends: 186 [2018-12-31 06:15:49,667 INFO L226 Difference]: Without dead ends: 183 [2018-12-31 06:15:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 06:15:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-31 06:15:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-31 06:15:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-31 06:15:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-12-31 06:15:49,677 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 175 [2018-12-31 06:15:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:49,677 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-12-31 06:15:49,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-31 06:15:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-12-31 06:15:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-31 06:15:49,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:49,683 INFO L402 BasicCegarLoop]: trace histogram [79, 41, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:49,683 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2140145552, now seen corresponding path program 42 times [2018-12-31 06:15:49,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:49,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:49,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3159 proven. 1600 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:50,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:50,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 06:15:50,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-12-31 06:15:50,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:50,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 1521 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-12-31 06:15:50,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:50,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 43 [2018-12-31 06:15:50,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-31 06:15:50,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-31 06:15:50,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:50,815 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 43 states. [2018-12-31 06:15:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:51,017 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-12-31 06:15:51,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-31 06:15:51,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2018-12-31 06:15:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:51,021 INFO L225 Difference]: With dead ends: 192 [2018-12-31 06:15:51,021 INFO L226 Difference]: Without dead ends: 189 [2018-12-31 06:15:51,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 06:15:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-31 06:15:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-31 06:15:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-31 06:15:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-12-31 06:15:51,027 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 181 [2018-12-31 06:15:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:51,027 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-12-31 06:15:51,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-31 06:15:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-12-31 06:15:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-31 06:15:51,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:51,028 INFO L402 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:51,028 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1121752098, now seen corresponding path program 43 times [2018-12-31 06:15:51,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:51,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3393 proven. 1849 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:51,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:51,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:52,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:15:55,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94] total 96 [2018-12-31 06:15:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-31 06:15:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-31 06:15:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-31 06:15:55,054 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 96 states. [2018-12-31 06:15:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:55,557 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-12-31 06:15:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-31 06:15:55,559 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 187 [2018-12-31 06:15:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:55,562 INFO L225 Difference]: With dead ends: 198 [2018-12-31 06:15:55,562 INFO L226 Difference]: Without dead ends: 195 [2018-12-31 06:15:55,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4300 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-31 06:15:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-31 06:15:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-31 06:15:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-31 06:15:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-12-31 06:15:55,568 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 187 [2018-12-31 06:15:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:55,569 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-12-31 06:15:55,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-31 06:15:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-12-31 06:15:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-31 06:15:55,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:55,570 INFO L402 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:55,570 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1893591860, now seen corresponding path program 44 times [2018-12-31 06:15:55,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:55,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:55,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:15:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3627 proven. 2116 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:56,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:56,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:15:56,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 06:15:56,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:15:56,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:15:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:15:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:15:58,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 97] total 99 [2018-12-31 06:15:58,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-31 06:15:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-31 06:15:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-12-31 06:15:58,017 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 99 states. [2018-12-31 06:15:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:15:58,496 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-12-31 06:15:58,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-31 06:15:58,497 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 193 [2018-12-31 06:15:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:15:58,499 INFO L225 Difference]: With dead ends: 204 [2018-12-31 06:15:58,499 INFO L226 Difference]: Without dead ends: 201 [2018-12-31 06:15:58,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4600 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-12-31 06:15:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-31 06:15:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-31 06:15:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-31 06:15:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-12-31 06:15:58,505 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 193 [2018-12-31 06:15:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:15:58,506 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-12-31 06:15:58,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-31 06:15:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-12-31 06:15:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-31 06:15:58,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:15:58,507 INFO L402 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:15:58,507 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:15:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:15:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1349659846, now seen corresponding path program 45 times [2018-12-31 06:15:58,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:15:58,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:15:58,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:58,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:15:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:15:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:15:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3861 proven. 2401 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2018-12-31 06:15:59,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:15:59,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:15:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 06:16:00,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2018-12-31 06:16:00,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:16:00,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:16:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:16:01,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:16:01,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100] total 102 [2018-12-31 06:16:01,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-31 06:16:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-31 06:16:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-31 06:16:01,149 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 102 states. [2018-12-31 06:16:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:16:01,698 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2018-12-31 06:16:01,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-31 06:16:01,700 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 199 [2018-12-31 06:16:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:16:01,702 INFO L225 Difference]: With dead ends: 209 [2018-12-31 06:16:01,702 INFO L226 Difference]: Without dead ends: 206 [2018-12-31 06:16:01,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-31 06:16:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-31 06:16:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-31 06:16:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-31 06:16:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-12-31 06:16:01,709 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 199 [2018-12-31 06:16:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:16:01,710 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-12-31 06:16:01,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-31 06:16:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-12-31 06:16:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-31 06:16:01,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:16:01,711 INFO L402 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:16:01,711 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:16:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:16:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash 782272296, now seen corresponding path program 46 times [2018-12-31 06:16:01,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:16:01,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:16:01,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:16:01,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:16:01,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:16:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:16:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-12-31 06:16:03,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:16:03,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 06:16:03,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 06:16:03,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 06:16:03,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:16:03,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:16:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-12-31 06:16:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:16:04,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-12-31 06:16:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-31 06:16:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-31 06:16:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-12-31 06:16:04,361 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 54 states. [2018-12-31 06:16:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:16:06,997 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-12-31 06:16:06,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-31 06:16:06,999 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 205 [2018-12-31 06:16:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:16:07,001 INFO L225 Difference]: With dead ends: 212 [2018-12-31 06:16:07,001 INFO L226 Difference]: Without dead ends: 209 [2018-12-31 06:16:07,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-12-31 06:16:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-31 06:16:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-12-31 06:16:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-31 06:16:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-12-31 06:16:07,011 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2018-12-31 06:16:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:16:07,011 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-12-31 06:16:07,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-31 06:16:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-12-31 06:16:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-31 06:16:07,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:16:07,012 INFO L402 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:16:07,013 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:16:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:16:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 136861218, now seen corresponding path program 47 times [2018-12-31 06:16:07,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:16:07,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:16:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:16:07,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 06:16:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:16:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:16:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2018-12-31 06:16:09,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:16:09,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-31 06:16:09,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-31 06:16:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-31 06:16:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 06:16:09,225 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 52 states. [2018-12-31 06:16:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:16:09,638 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2018-12-31 06:16:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-31 06:16:09,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2018-12-31 06:16:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:16:09,641 INFO L225 Difference]: With dead ends: 208 [2018-12-31 06:16:09,641 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 06:16:09,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-31 06:16:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 06:16:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 06:16:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 06:16:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 06:16:09,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-12-31 06:16:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:16:09,643 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 06:16:09,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-31 06:16:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 06:16:09,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 06:16:09,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 06:16:11,706 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2018-12-31 06:16:11,772 INFO L444 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 8) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L444 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 1) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,773 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2018-12-31 06:16:11,773 INFO L444 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,774 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2018-12-31 06:16:11,774 INFO L444 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 5) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,774 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2018-12-31 06:16:11,774 INFO L444 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 7) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,774 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2018-12-31 06:16:11,774 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2018-12-31 06:16:11,775 INFO L444 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 92 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 92) (<= 92 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 92)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 74 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 74) (<= 74 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 74)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 75) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (<= 88 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 88) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0) (<= 69 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 69)) (and (<= ULTIMATE.start_main_~main__x~0 95) (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0)) (and (<= 90 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 90) (<= 90 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 90)) (and (<= 68 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 68) (<= 68 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 68)) (and (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 97) (<= 97 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 85) (<= ULTIMATE.start_main_~main__x~0 85) (<= 85 ULTIMATE.start_main_~main__y~0) (<= 85 ULTIMATE.start_main_~main__x~0)) (and (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 91) (<= ULTIMATE.start_main_~main__y~0 91) (<= 91 ULTIMATE.start_main_~main__y~0)) (and (<= 71 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 71) (<= ULTIMATE.start_main_~main__x~0 71) (<= 71 ULTIMATE.start_main_~main__y~0)) (and (<= 83 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 83) (<= 83 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 83)) (and (<= ULTIMATE.start_main_~main__y~0 93) (<= 93 ULTIMATE.start_main_~main__x~0) (<= 93 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 93)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (<= 89 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 89) (<= ULTIMATE.start_main_~main__x~0 89)) (and (<= ULTIMATE.start_main_~main__y~0 84) (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 84)) (and (<= 80 ULTIMATE.start_main_~main__y~0) (<= 80 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 80) (<= ULTIMATE.start_main_~main__y~0 80)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (<= 100 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 70) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__y~0) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 79 ULTIMATE.start_main_~main__x~0) (<= 79 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 79) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 82) (<= 82 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 82)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 94) (<= 94 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 94)) (and (<= ULTIMATE.start_main_~main__x~0 67) (<= 67 ULTIMATE.start_main_~main__y~0) (<= 67 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 72) (<= ULTIMATE.start_main_~main__y~0 72)) (and (<= 78 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 78) (<= 78 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 78)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 86) (<= 86 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 96) (<= 96 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 96) (<= 96 ULTIMATE.start_main_~main__x~0)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 99 ULTIMATE.start_main_~main__x~0) (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 99) (<= ULTIMATE.start_main_~main__y~0 99)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= 81 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 81) (<= ULTIMATE.start_main_~main__x~0 81)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__y~0 98) (<= 98 ULTIMATE.start_main_~main__x~0) (<= 98 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 98)) (and (<= ULTIMATE.start_main_~main__y~0 73) (<= 73 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 73) (<= 73 ULTIMATE.start_main_~main__y~0)) (and (<= 77 ULTIMATE.start_main_~main__y~0) (<= 77 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 77) (<= ULTIMATE.start_main_~main__y~0 77)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 76 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 76) (<= 76 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 76)) (and (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 87) (<= ULTIMATE.start_main_~main__y~0 87))) [2018-12-31 06:16:11,776 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2018-12-31 06:16:11,776 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 06:16:11,776 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 06:16:11,776 INFO L444 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,776 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-31 06:16:11,776 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2018-12-31 06:16:11,776 INFO L451 ceAbstractionStarter]: At program point L207(lines 8 209) the Hoare annotation is: true [2018-12-31 06:16:11,776 INFO L444 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 4) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,777 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2018-12-31 06:16:11,777 INFO L444 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 6) (<= ULTIMATE.start_main_~main__y~0 50)) [2018-12-31 06:16:11,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-12-31 06:16:11,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:16:11 BoogieIcfgContainer [2018-12-31 06:16:11,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 06:16:11,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 06:16:11,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 06:16:11,815 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 06:16:11,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:14:43" (3/4) ... [2018-12-31 06:16:11,819 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 06:16:11,832 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 06:16:11,833 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 06:16:11,924 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 06:16:11,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 06:16:11,925 INFO L168 Benchmark]: Toolchain (without parser) took 89024.67 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 612.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 488.6 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,926 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:16:11,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,930 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:16:11,931 INFO L168 Benchmark]: RCFGBuilder took 581.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,931 INFO L168 Benchmark]: TraceAbstraction took 87971.51 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 487.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.8 MB). Peak memory consumption was 492.9 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,932 INFO L168 Benchmark]: Witness Printer took 109.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:16:11,938 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 581.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87971.51 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 487.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.8 MB). Peak memory consumption was 492.9 MB. Max. memory is 11.5 GB. * Witness Printer took 109.85 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__x <= 1 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__x <= 5 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((92 <= main__y && main__y <= 92) && 92 <= main__x) && main__x <= 92) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((74 <= main__y && main__y <= 74) && 74 <= main__x) && main__x <= 74)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__y <= 75 && 75 <= main__y) && main__x <= 75) && 75 <= main__x)) || (((88 <= main__x && main__x <= 88) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 69 && 69 <= main__x) && 69 <= main__y) && main__x <= 69)) || (((main__x <= 95 && 95 <= main__x) && main__y <= 95) && 95 <= main__y)) || (((90 <= main__y && main__x <= 90) && 90 <= main__x) && main__y <= 90)) || (((68 <= main__y && main__x <= 68) && 68 <= main__x) && main__y <= 68)) || (((main__y <= 97 && 97 <= main__x) && main__x <= 97) && 97 <= main__y)) || (((main__y <= 85 && main__x <= 85) && 85 <= main__y) && 85 <= main__x)) || (((91 <= main__x && main__x <= 91) && main__y <= 91) && 91 <= main__y)) || (((71 <= main__x && main__y <= 71) && main__x <= 71) && 71 <= main__y)) || (((83 <= main__x && main__y <= 83) && 83 <= main__y) && main__x <= 83)) || (((main__y <= 93 && 93 <= main__x) && 93 <= main__y) && main__x <= 93)) || (((89 <= main__x && 89 <= main__y) && main__y <= 89) && main__x <= 89)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((80 <= main__y && 80 <= main__x) && main__x <= 80) && main__y <= 80)) || ((100 <= main__x && main__y <= 100) && 100 <= main__y)) || (((main__x <= 70 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65)) || (((82 <= main__y && main__y <= 82) && 82 <= main__x) && main__x <= 82)) || (((94 <= main__x && main__x <= 94) && 94 <= main__y) && main__y <= 94)) || (((main__x <= 67 && 67 <= main__y) && 67 <= main__x) && main__y <= 67)) || (((72 <= main__y && 72 <= main__x) && main__x <= 72) && main__y <= 72)) || (((78 <= main__x && main__x <= 78) && 78 <= main__y) && main__y <= 78)) || (((main__y <= 86 && 86 <= main__x) && main__x <= 86) && 86 <= main__y)) || (((main__x <= 96 && 96 <= main__y) && main__y <= 96) && 96 <= main__x)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((99 <= main__x && 99 <= main__y) && main__x <= 99) && main__y <= 99)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((81 <= main__x && 81 <= main__y) && main__y <= 81) && main__x <= 81)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x)) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x <= 98)) || (((main__y <= 73 && 73 <= main__x) && main__x <= 73) && 73 <= main__y)) || (((77 <= main__y && 77 <= main__x) && main__x <= 77) && main__y <= 77)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((76 <= main__x && main__x <= 76) && 76 <= main__y) && main__y <= 76)) || (((87 <= main__y && 87 <= main__x) && main__x <= 87) && main__y <= 87) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__x <= 8 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 3) && main__y <= 50 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__x <= 7 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__x <= 2 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 6) && main__y <= 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 87.8s OverallTime, 55 OverallIterations, 92 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 1914 SDslu, 6115 SDs, 0 SdLazy, 13222 SolverSat, 2041 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6661 GetRequests, 4598 SyntacticMatches, 2 SemanticMatches, 2061 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13800 ImplicationChecksByTransitivity, 57.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 23 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 111 NumberOfFragments, 739 HoareAnnotationTreeSize, 10 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 59.9s InterpolantComputationTime, 10433 NumberOfCodeBlocks, 10371 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 10332 ConstructedInterpolants, 0 QuantifiedInterpolants, 3352268 SizeOfPredicates, 26 NumberOfNonLiveVariables, 12110 ConjunctsInSsa, 1527 ConjunctsInUnsatCore, 101 InterpolantComputations, 9 PerfectInterpolantSequences, 152159/241943 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...