./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem01_label42.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 1ced3eb982b16bda97708eba7d7a33ef6d709871 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:43:45,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:45,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:45,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:45,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:45,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:45,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:45,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:45,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:45,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:45,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:45,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:45,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:45,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:45,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:45,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:45,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:45,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:45,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:45,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:45,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:45,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:45,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:45,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:45,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:45,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:45,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:45,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:45,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:45,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:45,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:45,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:45,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:45,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:45,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:45,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:45,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:45,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:45,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:45,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:45,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:45,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:43:45,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:45,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:45,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:45,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:45,972 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:45,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:45,973 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:45,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:45,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:45,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:45,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:45,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:45,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:45,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:45,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:45,977 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:45,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:45,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:45,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:45,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:45,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:45,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:45,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:45,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:45,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:45,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:45,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:45,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:45,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:45,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 1ced3eb982b16bda97708eba7d7a33ef6d709871 [2019-11-28 15:43:46,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:46,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:46,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:46,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:46,318 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:46,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-28 15:43:46,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a347d6ce/16e7082b6cf14a3c9cb809fca6c54dae/FLAGf4ff73810 [2019-11-28 15:43:46,945 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:46,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-28 15:43:46,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a347d6ce/16e7082b6cf14a3c9cb809fca6c54dae/FLAGf4ff73810 [2019-11-28 15:43:47,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a347d6ce/16e7082b6cf14a3c9cb809fca6c54dae [2019-11-28 15:43:47,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:47,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:47,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:47,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:47,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:47,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:47,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51010f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47, skipping insertion in model container [2019-11-28 15:43:47,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:47,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:47,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:47,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:47,814 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:47,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:47,967 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:47,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47 WrapperNode [2019-11-28 15:43:47,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:47,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:47,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:47,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:47,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:47,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:48,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:48,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:48,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:48,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... [2019-11-28 15:43:48,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:48,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:48,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:48,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:48,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:49,558 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:49,559 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:49,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:49 BoogieIcfgContainer [2019-11-28 15:43:49,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:49,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:49,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:49,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:49,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:47" (1/3) ... [2019-11-28 15:43:49,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d076ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:49, skipping insertion in model container [2019-11-28 15:43:49,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:47" (2/3) ... [2019-11-28 15:43:49,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d076ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:49, skipping insertion in model container [2019-11-28 15:43:49,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:49" (3/3) ... [2019-11-28 15:43:49,570 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-11-28 15:43:49,581 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:49,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:49,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:49,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:49,633 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:49,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:49,633 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:49,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:49,634 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:49,634 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:49,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-28 15:43:49,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:49,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:49,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1613704130, now seen corresponding path program 1 times [2019-11-28 15:43:49,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:49,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808348150] [2019-11-28 15:43:49,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:50,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808348150] [2019-11-28 15:43:50,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:50,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:50,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246897516] [2019-11-28 15:43:50,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:50,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:50,182 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-28 15:43:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:51,177 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-28 15:43:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:51,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-28 15:43:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:51,196 INFO L225 Difference]: With dead ends: 528 [2019-11-28 15:43:51,196 INFO L226 Difference]: Without dead ends: 266 [2019-11-28 15:43:51,201 INFO L630 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-11-28 15:43:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-28 15:43:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-28 15:43:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:43:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-28 15:43:51,273 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 115 [2019-11-28 15:43:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:51,274 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-28 15:43:51,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-28 15:43:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 15:43:51,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:51,279 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:51,279 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1626358534, now seen corresponding path program 1 times [2019-11-28 15:43:51,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:51,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357473883] [2019-11-28 15:43:51,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:43:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357473883] [2019-11-28 15:43:51,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:51,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:51,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488064859] [2019-11-28 15:43:51,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:51,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:51,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:51,510 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 4 states. [2019-11-28 15:43:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:52,354 INFO L93 Difference]: Finished difference Result 1054 states and 1488 transitions. [2019-11-28 15:43:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:52,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-28 15:43:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:52,372 INFO L225 Difference]: With dead ends: 1054 [2019-11-28 15:43:52,372 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:52,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 528. [2019-11-28 15:43:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-28 15:43:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-28 15:43:52,423 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 119 [2019-11-28 15:43:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:52,424 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-28 15:43:52,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-28 15:43:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-28 15:43:52,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:52,431 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:52,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash -951101936, now seen corresponding path program 1 times [2019-11-28 15:43:52,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:52,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568593670] [2019-11-28 15:43:52,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:43:52,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568593670] [2019-11-28 15:43:52,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:52,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:52,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866217835] [2019-11-28 15:43:52,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:52,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:52,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:52,596 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-28 15:43:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:53,145 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-28 15:43:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:53,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-28 15:43:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:53,150 INFO L225 Difference]: With dead ends: 1316 [2019-11-28 15:43:53,150 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:53,152 INFO L630 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-11-28 15:43:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-28 15:43:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 15:43:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-28 15:43:53,176 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 149 [2019-11-28 15:43:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:53,176 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-28 15:43:53,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-28 15:43:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 15:43:53,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:53,180 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:53,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1921921286, now seen corresponding path program 1 times [2019-11-28 15:43:53,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:53,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120348494] [2019-11-28 15:43:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 15:43:53,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120348494] [2019-11-28 15:43:53,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:53,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:53,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327563805] [2019-11-28 15:43:53,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:53,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:53,316 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-28 15:43:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:54,099 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-28 15:43:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:54,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-28 15:43:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:54,105 INFO L225 Difference]: With dead ends: 1449 [2019-11-28 15:43:54,105 INFO L226 Difference]: Without dead ends: 792 [2019-11-28 15:43:54,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-28 15:43:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-28 15:43:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-28 15:43:54,137 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 153 [2019-11-28 15:43:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:54,137 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-28 15:43:54,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-28 15:43:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 15:43:54,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:54,144 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:54,144 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash -680769074, now seen corresponding path program 1 times [2019-11-28 15:43:54,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:54,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698683518] [2019-11-28 15:43:54,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:43:54,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698683518] [2019-11-28 15:43:54,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:54,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:54,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596796543] [2019-11-28 15:43:54,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:54,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:54,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:54,244 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-28 15:43:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:54,953 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-28 15:43:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:54,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-28 15:43:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:54,961 INFO L225 Difference]: With dead ends: 1709 [2019-11-28 15:43:54,963 INFO L226 Difference]: Without dead ends: 1052 [2019-11-28 15:43:54,965 INFO L630 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-11-28 15:43:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-28 15:43:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-28 15:43:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-28 15:43:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-28 15:43:55,007 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 157 [2019-11-28 15:43:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:55,008 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-28 15:43:55,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-28 15:43:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-28 15:43:55,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:55,015 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:55,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash 556803504, now seen corresponding path program 1 times [2019-11-28 15:43:55,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:55,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650705354] [2019-11-28 15:43:55,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-28 15:43:55,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650705354] [2019-11-28 15:43:55,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:55,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:55,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139495313] [2019-11-28 15:43:55,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:55,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:55,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:55,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:55,143 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-28 15:43:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:55,904 INFO L93 Difference]: Finished difference Result 3150 states and 3974 transitions. [2019-11-28 15:43:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:55,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-28 15:43:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:55,915 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:55,916 INFO L226 Difference]: Without dead ends: 2231 [2019-11-28 15:43:55,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-28 15:43:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-11-28 15:43:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2019-11-28 15:43:55,969 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 166 [2019-11-28 15:43:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:55,969 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2019-11-28 15:43:55,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2019-11-28 15:43:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-28 15:43:55,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:55,975 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:55,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash 390134956, now seen corresponding path program 1 times [2019-11-28 15:43:55,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:55,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869196740] [2019-11-28 15:43:55,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-28 15:43:56,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869196740] [2019-11-28 15:43:56,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:56,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:56,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915545136] [2019-11-28 15:43:56,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:43:56,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:43:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:56,105 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand 5 states. [2019-11-28 15:43:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:57,262 INFO L93 Difference]: Finished difference Result 3543 states and 4355 transitions. [2019-11-28 15:43:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:57,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-11-28 15:43:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:57,272 INFO L225 Difference]: With dead ends: 3543 [2019-11-28 15:43:57,272 INFO L226 Difference]: Without dead ends: 2100 [2019-11-28 15:43:57,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-28 15:43:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-28 15:43:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-28 15:43:57,316 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 190 [2019-11-28 15:43:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:57,317 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-28 15:43:57,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:43:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-28 15:43:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-28 15:43:57,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:57,322 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:57,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 128921415, now seen corresponding path program 1 times [2019-11-28 15:43:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246214606] [2019-11-28 15:43:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-28 15:43:57,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246214606] [2019-11-28 15:43:57,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:57,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:57,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465532445] [2019-11-28 15:43:57,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:57,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:57,390 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-28 15:43:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:57,871 INFO L93 Difference]: Finished difference Result 4067 states and 4903 transitions. [2019-11-28 15:43:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:57,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-28 15:43:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:57,881 INFO L225 Difference]: With dead ends: 4067 [2019-11-28 15:43:57,881 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:57,885 INFO L630 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-11-28 15:43:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-28 15:43:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-28 15:43:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-11-28 15:43:57,921 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 193 [2019-11-28 15:43:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:57,921 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-11-28 15:43:57,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-11-28 15:43:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-28 15:43:57,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:57,927 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:57,927 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2022598972, now seen corresponding path program 1 times [2019-11-28 15:43:57,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:57,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937013156] [2019-11-28 15:43:57,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-28 15:43:58,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937013156] [2019-11-28 15:43:58,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256852502] [2019-11-28 15:43:58,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:58,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:43:58,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:43:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 15:43:58,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:43:58,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-28 15:43:58,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302258183] [2019-11-28 15:43:58,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:58,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:58,437 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 3 states. [2019-11-28 15:43:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:58,950 INFO L93 Difference]: Finished difference Result 3672 states and 4041 transitions. [2019-11-28 15:43:58,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:58,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-11-28 15:43:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:58,951 INFO L225 Difference]: With dead ends: 3672 [2019-11-28 15:43:58,951 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:58,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:58,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-11-28 15:43:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:58,957 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:58,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:58,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:59,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:59,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:59,436 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-28 15:43:59,621 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-28 15:43:59,626 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:59,626 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:59,626 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,626 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,626 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:59,627 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,628 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:59,629 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:59,630 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:59,631 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:59,632 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:59,632 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:59,632 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:59,632 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:59,632 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a20~0 1)) (.cse7 (= ~a16~0 5)) (.cse4 (<= ~a17~0 0)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse7) (and .cse5 .cse3 .cse7) (and .cse4 .cse5 .cse6))) [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:59,633 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:59,634 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:59,635 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:59,636 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:59,636 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:59,636 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:59,636 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:59,636 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,637 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:59,638 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,639 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse2 (= ~a17~0 1)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a20~0 1)) (.cse7 (= ~a16~0 5)) (.cse4 (<= ~a17~0 0)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse2 .cse5 .cse6) (and .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse7) (and .cse5 .cse3 .cse7) (and .cse4 .cse5 .cse6))) [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:59,640 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,641 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:59,642 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:59,643 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:59,644 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,645 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:59,646 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-11-28 15:43:59,647 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:59,648 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:59,649 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:59,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:59 BoogieIcfgContainer [2019-11-28 15:43:59,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:59,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:59,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:59,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:59,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:49" (3/4) ... [2019-11-28 15:43:59,690 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:59,731 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:59,733 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:44:00,007 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:44:00,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:44:00,009 INFO L168 Benchmark]: Toolchain (without parser) took 12813.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.2 MB). Free memory was 948.3 MB in the beginning and 1.3 GB in the end (delta: -324.2 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:00,010 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:00,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:00,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.02 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-11-28 15:44:00,012 INFO L168 Benchmark]: Boogie Preprocessor took 74.88 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-11-28 15:44:00,012 INFO L168 Benchmark]: RCFGBuilder took 1425.59 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: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:00,013 INFO L168 Benchmark]: TraceAbstraction took 10120.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -280.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:00,013 INFO L168 Benchmark]: Witness Printer took 324.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:00,017 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 770.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.02 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. * Boogie Preprocessor took 74.88 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 1425.59 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: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10120.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -280.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 324.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 649 SDtfs, 1722 SDslu, 75 SDs, 0 SdLazy, 4105 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1574 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 193 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2083 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 216 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 629216 SizeOfPredicates, 1 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 793/797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...