./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label54_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/eca-rers2012/Problem02_label54_true-unreach-call_false-termination.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 7013b5440d15c52781747fe18e114861ef321ee3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:56:53,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:56:53,849 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:56:53,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:56:53,867 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:56:53,868 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:56:53,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:56:53,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:56:53,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:56:53,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:56:53,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:56:53,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:56:53,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:56:53,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:56:53,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:56:53,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:56:53,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:56:53,885 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:56:53,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:56:53,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:56:53,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:56:53,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:56:53,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:56:53,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:56:53,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:56:53,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:56:53,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:56:53,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:56:53,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:56:53,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:56:53,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:56:53,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:56:53,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:56:53,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:56:53,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:56:53,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:56:53,905 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:56:53,927 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:56:53,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:56:53,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:56:53,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:56:53,930 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:56:53,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:56:53,931 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:56:53,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:56:53,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:56:53,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:56:53,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:56:53,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:56:53,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:56:53,934 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:56:53,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:56:53,934 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:56:53,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:56:53,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:56:53,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:56:53,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:56:53,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:56:53,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:53,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:56:53,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:56:53,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:56:53,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:56:53,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:56:53,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:56:53,938 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 -> 7013b5440d15c52781747fe18e114861ef321ee3 [2019-01-12 00:56:54,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:56:54,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:56:54,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:56:54,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:56:54,033 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:56:54,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label54_true-unreach-call_false-termination.c [2019-01-12 00:56:54,095 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1365e9d7/39ed92467230461dbc96f965627efce9/FLAGe3a47ba8d [2019-01-12 00:56:54,605 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:56:54,608 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label54_true-unreach-call_false-termination.c [2019-01-12 00:56:54,626 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1365e9d7/39ed92467230461dbc96f965627efce9/FLAGe3a47ba8d [2019-01-12 00:56:54,879 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1365e9d7/39ed92467230461dbc96f965627efce9 [2019-01-12 00:56:54,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:56:54,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:56:54,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:54,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:56:54,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:56:54,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:54" (1/1) ... [2019-01-12 00:56:54,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:54, skipping insertion in model container [2019-01-12 00:56:54,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:54" (1/1) ... [2019-01-12 00:56:54,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:56:54,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:56:55,384 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:55,395 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:56:55,535 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:55,555 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:56:55,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55 WrapperNode [2019-01-12 00:56:55,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:55,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:55,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:56:55,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:56:55,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:55,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:56:55,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:56:55,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:56:55,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... [2019-01-12 00:56:55,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:56:55,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:56:55,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:56:55,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:56:55,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:56:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:56:58,970 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:56:58,972 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:56:58,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:58 BoogieIcfgContainer [2019-01-12 00:56:58,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:56:58,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:56:58,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:56:58,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:56:58,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:56:54" (1/3) ... [2019-01-12 00:56:58,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6ea01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:58, skipping insertion in model container [2019-01-12 00:56:58,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:55" (2/3) ... [2019-01-12 00:56:58,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6ea01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:58, skipping insertion in model container [2019-01-12 00:56:58,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:58" (3/3) ... [2019-01-12 00:56:58,984 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label54_true-unreach-call_false-termination.c [2019-01-12 00:56:58,992 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:56:59,001 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:56:59,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:56:59,052 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:56:59,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:56:59,053 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:56:59,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:56:59,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:56:59,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:56:59,054 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:56:59,054 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:56:59,054 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:56:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:56:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 00:56:59,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:59,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:59,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1695579141, now seen corresponding path program 1 times [2019-01-12 00:56:59,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:59,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:59,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:59,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:56:59,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:59,647 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2019-01-12 00:57:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:01,340 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2019-01-12 00:57:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:01,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 00:57:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:01,360 INFO L225 Difference]: With dead ends: 601 [2019-01-12 00:57:01,360 INFO L226 Difference]: Without dead ends: 310 [2019-01-12 00:57:01,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-12 00:57:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-01-12 00:57:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-01-12 00:57:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2019-01-12 00:57:01,432 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 101 [2019-01-12 00:57:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:01,433 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2019-01-12 00:57:01,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2019-01-12 00:57:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 00:57:01,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:01,438 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:01,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -292589926, now seen corresponding path program 1 times [2019-01-12 00:57:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:57:01,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:01,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:01,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:01,627 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand 4 states. [2019-01-12 00:57:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:03,561 INFO L93 Difference]: Finished difference Result 1200 states and 1733 transitions. [2019-01-12 00:57:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:03,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-12 00:57:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:03,570 INFO L225 Difference]: With dead ends: 1200 [2019-01-12 00:57:03,570 INFO L226 Difference]: Without dead ends: 892 [2019-01-12 00:57:03,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-01-12 00:57:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 593. [2019-01-12 00:57:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-01-12 00:57:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 827 transitions. [2019-01-12 00:57:03,620 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 827 transitions. Word has length 119 [2019-01-12 00:57:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:03,623 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 827 transitions. [2019-01-12 00:57:03,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 827 transitions. [2019-01-12 00:57:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 00:57:03,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:03,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:03,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 566132794, now seen corresponding path program 1 times [2019-01-12 00:57:03,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:03,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:57:03,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:03,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:03,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:03,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:03,914 INFO L87 Difference]: Start difference. First operand 593 states and 827 transitions. Second operand 4 states. [2019-01-12 00:57:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:06,373 INFO L93 Difference]: Finished difference Result 2316 states and 3244 transitions. [2019-01-12 00:57:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:06,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-01-12 00:57:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:06,383 INFO L225 Difference]: With dead ends: 2316 [2019-01-12 00:57:06,384 INFO L226 Difference]: Without dead ends: 1725 [2019-01-12 00:57:06,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-01-12 00:57:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1151. [2019-01-12 00:57:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-12 00:57:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1548 transitions. [2019-01-12 00:57:06,430 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1548 transitions. Word has length 120 [2019-01-12 00:57:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:06,431 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 1548 transitions. [2019-01-12 00:57:06,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1548 transitions. [2019-01-12 00:57:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 00:57:06,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:06,435 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:06,435 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash -157142321, now seen corresponding path program 1 times [2019-01-12 00:57:06,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:06,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:57:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:06,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:57:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:06,615 INFO L87 Difference]: Start difference. First operand 1151 states and 1548 transitions. Second operand 4 states. [2019-01-12 00:57:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:08,008 INFO L93 Difference]: Finished difference Result 3563 states and 4698 transitions. [2019-01-12 00:57:08,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-01-12 00:57:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:08,019 INFO L225 Difference]: With dead ends: 3563 [2019-01-12 00:57:08,019 INFO L226 Difference]: Without dead ends: 2414 [2019-01-12 00:57:08,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-01-12 00:57:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2131. [2019-01-12 00:57:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-01-12 00:57:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2618 transitions. [2019-01-12 00:57:08,069 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2618 transitions. Word has length 123 [2019-01-12 00:57:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:08,072 INFO L480 AbstractCegarLoop]: Abstraction has 2131 states and 2618 transitions. [2019-01-12 00:57:08,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2618 transitions. [2019-01-12 00:57:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 00:57:08,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:08,077 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:08,078 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash -920596231, now seen corresponding path program 1 times [2019-01-12 00:57:08,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:08,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:08,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:08,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:57:08,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:57:08,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:08,313 INFO L87 Difference]: Start difference. First operand 2131 states and 2618 transitions. Second operand 4 states. [2019-01-12 00:57:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:09,173 INFO L93 Difference]: Finished difference Result 5105 states and 6307 transitions. [2019-01-12 00:57:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:09,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-01-12 00:57:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:09,185 INFO L225 Difference]: With dead ends: 5105 [2019-01-12 00:57:09,185 INFO L226 Difference]: Without dead ends: 2414 [2019-01-12 00:57:09,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-01-12 00:57:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2410. [2019-01-12 00:57:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-01-12 00:57:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2692 transitions. [2019-01-12 00:57:09,234 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2692 transitions. Word has length 128 [2019-01-12 00:57:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:09,235 INFO L480 AbstractCegarLoop]: Abstraction has 2410 states and 2692 transitions. [2019-01-12 00:57:09,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2692 transitions. [2019-01-12 00:57:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-12 00:57:09,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:09,241 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:09,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash -91008860, now seen corresponding path program 1 times [2019-01-12 00:57:09,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:09,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:09,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 00:57:09,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:09,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:09,343 INFO L87 Difference]: Start difference. First operand 2410 states and 2692 transitions. Second operand 4 states. [2019-01-12 00:57:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:09,941 INFO L93 Difference]: Finished difference Result 4526 states and 5047 transitions. [2019-01-12 00:57:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:09,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-01-12 00:57:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:09,953 INFO L225 Difference]: With dead ends: 4526 [2019-01-12 00:57:09,953 INFO L226 Difference]: Without dead ends: 2117 [2019-01-12 00:57:09,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-01-12 00:57:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1557. [2019-01-12 00:57:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-01-12 00:57:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1702 transitions. [2019-01-12 00:57:09,997 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1702 transitions. Word has length 140 [2019-01-12 00:57:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:09,997 INFO L480 AbstractCegarLoop]: Abstraction has 1557 states and 1702 transitions. [2019-01-12 00:57:09,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1702 transitions. [2019-01-12 00:57:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 00:57:10,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:10,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:10,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1260894349, now seen corresponding path program 1 times [2019-01-12 00:57:10,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:10,303 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 00:57:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:57:10,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:10,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 00:57:10,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:57:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:57:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:57:10,718 INFO L87 Difference]: Start difference. First operand 1557 states and 1702 transitions. Second operand 7 states. [2019-01-12 00:57:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:12,770 INFO L93 Difference]: Finished difference Result 3266 states and 3576 transitions. [2019-01-12 00:57:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 00:57:12,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-01-12 00:57:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:12,781 INFO L225 Difference]: With dead ends: 3266 [2019-01-12 00:57:12,782 INFO L226 Difference]: Without dead ends: 1571 [2019-01-12 00:57:12,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:57:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-01-12 00:57:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1417. [2019-01-12 00:57:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-01-12 00:57:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1553 transitions. [2019-01-12 00:57:12,842 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1553 transitions. Word has length 169 [2019-01-12 00:57:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:12,843 INFO L480 AbstractCegarLoop]: Abstraction has 1417 states and 1553 transitions. [2019-01-12 00:57:12,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:57:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1553 transitions. [2019-01-12 00:57:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-12 00:57:12,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:12,852 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:12,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash 992818194, now seen corresponding path program 1 times [2019-01-12 00:57:12,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:12,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:12,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:12,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:13,283 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 00:57:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:57:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:57:13,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:13,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:13,433 INFO L87 Difference]: Start difference. First operand 1417 states and 1553 transitions. Second operand 4 states. [2019-01-12 00:57:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:16,084 INFO L93 Difference]: Finished difference Result 2691 states and 2953 transitions. [2019-01-12 00:57:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:16,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-01-12 00:57:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:16,090 INFO L225 Difference]: With dead ends: 2691 [2019-01-12 00:57:16,090 INFO L226 Difference]: Without dead ends: 1136 [2019-01-12 00:57:16,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-01-12 00:57:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1135. [2019-01-12 00:57:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-01-12 00:57:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1216 transitions. [2019-01-12 00:57:16,114 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1216 transitions. Word has length 178 [2019-01-12 00:57:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:16,115 INFO L480 AbstractCegarLoop]: Abstraction has 1135 states and 1216 transitions. [2019-01-12 00:57:16,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1216 transitions. [2019-01-12 00:57:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 00:57:16,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:16,120 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:57:16,120 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash -751837008, now seen corresponding path program 1 times [2019-01-12 00:57:16,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:16,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 00:57:16,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:16,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:16,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:16,304 INFO L87 Difference]: Start difference. First operand 1135 states and 1216 transitions. Second operand 3 states. [2019-01-12 00:57:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:16,942 INFO L93 Difference]: Finished difference Result 2268 states and 2425 transitions. [2019-01-12 00:57:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:16,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-01-12 00:57:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:16,943 INFO L225 Difference]: With dead ends: 2268 [2019-01-12 00:57:16,943 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:57:16,946 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 [2019-01-12 00:57:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:57:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:57:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:57:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:57:16,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2019-01-12 00:57:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:16,947 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:57:16,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:57:16,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:57:16,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:57:17,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:57:17,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:57:17,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:57:17,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:57:18,112 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-01-12 00:57:18,548 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-01-12 00:57:18,551 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,551 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,552 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 475) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:57:18,553 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:57:18,554 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:57:18,555 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:57:18,556 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:57:18,557 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:57:18,558 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:57:18,559 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:57:18,560 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:57:18,561 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:57:18,562 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:57:18,563 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a11~0 1))) (let ((.cse1 (not .cse9)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a28~0 10)) (.cse7 (<= ~a17~0 8)) (.cse2 (= ~a17~0 8)) (.cse10 (not .cse3)) (.cse5 (not .cse8)) (.cse6 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse0) (and .cse2 .cse5 .cse1 .cse6) (and (and .cse0 .cse7 .cse6) .cse3) (and .cse8 .cse2 .cse0) (and .cse9 .cse4 .cse10 .cse7) (and .cse8 .cse3 .cse7) (and .cse2 .cse10 .cse5 .cse6)))) [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:57:18,564 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:57:18,565 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:57:18,566 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse9 (= ~a11~0 1))) (let ((.cse1 (not .cse9)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a28~0 10)) (.cse7 (<= ~a17~0 8)) (.cse2 (= ~a17~0 8)) (.cse10 (not .cse3)) (.cse5 (not .cse8)) (.cse6 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse0) (and .cse2 .cse5 .cse1 .cse6) (and (and .cse0 .cse7 .cse6) .cse3) (and .cse8 .cse2 .cse0) (and .cse9 .cse4 .cse10 .cse7) (and .cse8 .cse3 .cse7) (and .cse2 .cse10 .cse5 .cse6)))) [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,567 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:57:18,568 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:57:18,569 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,570 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:57:18,571 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,572 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:57:18,573 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:57:18,574 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:57:18,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:57:18 BoogieIcfgContainer [2019-01-12 00:57:18,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:57:18,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:57:18,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:57:18,628 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:57:18,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:58" (3/4) ... [2019-01-12 00:57:18,634 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:57:18,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:57:18,660 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:57:18,929 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:57:18,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:57:18,934 INFO L168 Benchmark]: Toolchain (without parser) took 24050.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,935 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. [2019-01-12 00:57:18,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.07 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,937 INFO L168 Benchmark]: Boogie Preprocessor took 68.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,938 INFO L168 Benchmark]: RCFGBuilder took 3179.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,939 INFO L168 Benchmark]: TraceAbstraction took 19651.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -172.0 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,939 INFO L168 Benchmark]: Witness Printer took 305.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:57:18,943 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 669.07 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 170.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3179.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19651.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -172.0 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * Witness Printer took 305.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 475]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((a19 == 1 && !(a11 == 1)) && a17 == 8) && a25 == 1) || (a28 == 10 && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(a11 == 1)) && !(a28 == 11))) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a11 == 1 && a28 == 10) && !(a25 == 1)) && a17 <= 8)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a19 == 1 && !(a11 == 1)) && a17 == 8) && a25 == 1) || (a28 == 10 && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(a11 == 1)) && !(a28 == 11))) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a11 == 1 && a28 == 10) && !(a25 == 1)) && a17 <= 8)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 803 SDtfs, 2334 SDslu, 259 SDs, 0 SdLazy, 5614 SolverSat, 808 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1875 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 35 NumberOfFragments, 209 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1416 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 836 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1268 ConstructedInterpolants, 0 QuantifiedInterpolants, 617302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...