./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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_label14.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 d50ba566f02e5109971f6a90ba216a95432a7661 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:52:32,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:52:32,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:52:32,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:52:32,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:52:32,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:52:32,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:52:32,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:52:32,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:52:32,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:52:32,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:52:32,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:52:32,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:52:32,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:52:32,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:52:32,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:52:32,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:52:32,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:52:32,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:52:32,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:52:32,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:52:32,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:52:32,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:52:32,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:52:32,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:52:32,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:52:32,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:52:32,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:52:32,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:52:32,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:52:32,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:52:32,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:52:32,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:52:32,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:52:32,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:52:32,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:52:32,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:52:32,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:52:32,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:52:32,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:52:32,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:52:32,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:52:32,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:52:32,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:52:32,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:52:32,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:52:32,953 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:52:32,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:52:32,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:52:32,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:52:32,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:52:32,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:52:32,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:52:32,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:52:32,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:52:32,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:52:32,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:52:32,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:52:32,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:52:32,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:52:32,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:52:32,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:52:32,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:52:32,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:32,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:52:32,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:52:32,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:52:32,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:52:32,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:52:32,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:52:32,961 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 -> d50ba566f02e5109971f6a90ba216a95432a7661 [2019-11-19 20:52:33,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:52:33,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:52:33,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:52:33,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:52:33,286 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:52:33,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-19 20:52:33,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df81d11a8/20ec1c4437434a089f7c68529a6bd88b/FLAG0c5f92e10 [2019-11-19 20:52:33,894 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:52:33,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-19 20:52:33,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df81d11a8/20ec1c4437434a089f7c68529a6bd88b/FLAG0c5f92e10 [2019-11-19 20:52:34,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df81d11a8/20ec1c4437434a089f7c68529a6bd88b [2019-11-19 20:52:34,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:52:34,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:52:34,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:34,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:52:34,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:52:34,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:34,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eeec4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34, skipping insertion in model container [2019-11-19 20:52:34,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:34,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:52:34,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:52:34,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:34,811 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:52:34,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:34,948 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:52:34,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34 WrapperNode [2019-11-19 20:52:34,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:34,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:34,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:52:34,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:52:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:34,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:35,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:52:35,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:52:35,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:52:35,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (1/1) ... [2019-11-19 20:52:35,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:52:35,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:52:35,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:52:35,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:52:35,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (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-19 20:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:52:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:52:36,448 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:52:36,449 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:52:36,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:36 BoogieIcfgContainer [2019-11-19 20:52:36,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:52:36,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:52:36,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:52:36,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:52:36,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:34" (1/3) ... [2019-11-19 20:52:36,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:36, skipping insertion in model container [2019-11-19 20:52:36,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:34" (2/3) ... [2019-11-19 20:52:36,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd1220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:36, skipping insertion in model container [2019-11-19 20:52:36,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:36" (3/3) ... [2019-11-19 20:52:36,461 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-11-19 20:52:36,471 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:52:36,479 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:52:36,490 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:52:36,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:52:36,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:52:36,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:52:36,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:52:36,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:52:36,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:52:36,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:52:36,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:52:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-19 20:52:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-19 20:52:36,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:36,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:36,570 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2019-11-19 20:52:36,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:36,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005448447] [2019-11-19 20:52:36,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:37,784 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-19 20:52:37,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005448447] [2019-11-19 20:52:37,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:37,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 20:52:37,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592453249] [2019-11-19 20:52:37,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 20:52:37,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 20:52:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:52:37,815 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-19 20:52:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:39,109 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-19 20:52:39,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 20:52:39,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-11-19 20:52:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:39,135 INFO L225 Difference]: With dead ends: 493 [2019-11-19 20:52:39,135 INFO L226 Difference]: Without dead ends: 193 [2019-11-19 20:52:39,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-19 20:52:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-19 20:52:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-19 20:52:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-19 20:52:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-19 20:52:39,190 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2019-11-19 20:52:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:39,191 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-19 20:52:39,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 20:52:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-19 20:52:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-19 20:52:39,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:39,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:39,197 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2019-11-19 20:52:39,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:39,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497992207] [2019-11-19 20:52:39,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:39,344 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-19 20:52:39,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497992207] [2019-11-19 20:52:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:39,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:39,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445076212] [2019-11-19 20:52:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:39,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:39,350 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-11-19 20:52:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:39,787 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-11-19 20:52:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:39,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-19 20:52:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:39,795 INFO L225 Difference]: With dead ends: 457 [2019-11-19 20:52:39,797 INFO L226 Difference]: Without dead ends: 324 [2019-11-19 20:52:39,798 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-19 20:52:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-19 20:52:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-19 20:52:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-19 20:52:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-11-19 20:52:39,819 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2019-11-19 20:52:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:39,820 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-11-19 20:52:39,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-11-19 20:52:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 20:52:39,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:39,824 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:39,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:39,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2019-11-19 20:52:39,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:39,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549022786] [2019-11-19 20:52:39,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 20:52:39,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549022786] [2019-11-19 20:52:39,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:39,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:39,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112256208] [2019-11-19 20:52:39,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:39,921 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-11-19 20:52:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:40,592 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2019-11-19 20:52:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:40,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-19 20:52:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:40,596 INFO L225 Difference]: With dead ends: 850 [2019-11-19 20:52:40,596 INFO L226 Difference]: Without dead ends: 586 [2019-11-19 20:52:40,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-19 20:52:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-19 20:52:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-19 20:52:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2019-11-19 20:52:40,623 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2019-11-19 20:52:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:40,623 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2019-11-19 20:52:40,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2019-11-19 20:52:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 20:52:40,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:40,629 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:40,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2019-11-19 20:52:40,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:40,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138765924] [2019-11-19 20:52:40,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 20:52:40,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138765924] [2019-11-19 20:52:40,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:40,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:40,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662583408] [2019-11-19 20:52:40,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:40,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:40,728 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2019-11-19 20:52:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:41,201 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2019-11-19 20:52:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:41,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-19 20:52:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:41,207 INFO L225 Difference]: With dead ends: 1243 [2019-11-19 20:52:41,207 INFO L226 Difference]: Without dead ends: 717 [2019-11-19 20:52:41,209 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-19 20:52:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-19 20:52:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2019-11-19 20:52:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-19 20:52:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2019-11-19 20:52:41,224 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2019-11-19 20:52:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:41,224 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2019-11-19 20:52:41,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2019-11-19 20:52:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-19 20:52:41,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:41,227 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:41,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2019-11-19 20:52:41,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:41,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565810954] [2019-11-19 20:52:41,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 20:52:41,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565810954] [2019-11-19 20:52:41,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:41,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:41,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137475798] [2019-11-19 20:52:41,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:41,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:41,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:41,277 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2019-11-19 20:52:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:42,067 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2019-11-19 20:52:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:42,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-19 20:52:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:42,075 INFO L225 Difference]: With dead ends: 2029 [2019-11-19 20:52:42,076 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 20:52:42,077 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-19 20:52:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 20:52:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-19 20:52:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-19 20:52:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2019-11-19 20:52:42,108 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2019-11-19 20:52:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:42,108 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2019-11-19 20:52:42,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2019-11-19 20:52:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-19 20:52:42,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:42,113 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:42,113 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2019-11-19 20:52:42,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:42,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822144331] [2019-11-19 20:52:42,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 20:52:42,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822144331] [2019-11-19 20:52:42,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:42,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:42,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260108501] [2019-11-19 20:52:42,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:52:42,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:52:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:42,198 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2019-11-19 20:52:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:43,325 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2019-11-19 20:52:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:52:43,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-19 20:52:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:43,333 INFO L225 Difference]: With dead ends: 2815 [2019-11-19 20:52:43,333 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 20:52:43,335 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-19 20:52:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 20:52:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 20:52:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 20:52:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2019-11-19 20:52:43,363 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2019-11-19 20:52:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:43,364 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2019-11-19 20:52:43,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:52:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2019-11-19 20:52:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-19 20:52:43,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:43,369 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:43,369 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2019-11-19 20:52:43,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:43,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651560955] [2019-11-19 20:52:43,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 20:52:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651560955] [2019-11-19 20:52:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364244886] [2019-11-19 20:52:43,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:43,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:43,420 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2019-11-19 20:52:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:43,966 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2019-11-19 20:52:43,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:43,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-19 20:52:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:43,977 INFO L225 Difference]: With dead ends: 3601 [2019-11-19 20:52:43,977 INFO L226 Difference]: Without dead ends: 1896 [2019-11-19 20:52:43,979 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-19 20:52:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-19 20:52:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2019-11-19 20:52:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-19 20:52:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2019-11-19 20:52:44,011 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2019-11-19 20:52:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:44,012 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2019-11-19 20:52:44,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2019-11-19 20:52:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-19 20:52:44,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:44,017 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:44,017 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2019-11-19 20:52:44,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:44,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166233346] [2019-11-19 20:52:44,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:44,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166233346] [2019-11-19 20:52:44,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:44,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:44,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315265205] [2019-11-19 20:52:44,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:52:44,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:52:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:44,111 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2019-11-19 20:52:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:45,061 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2019-11-19 20:52:45,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:52:45,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-19 20:52:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:45,076 INFO L225 Difference]: With dead ends: 4782 [2019-11-19 20:52:45,076 INFO L226 Difference]: Without dead ends: 3077 [2019-11-19 20:52:45,080 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-19 20:52:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-11-19 20:52:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2019-11-19 20:52:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-19 20:52:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2019-11-19 20:52:45,136 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2019-11-19 20:52:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:45,136 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2019-11-19 20:52:45,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:52:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2019-11-19 20:52:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-19 20:52:45,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:45,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:45,144 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2019-11-19 20:52:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221476651] [2019-11-19 20:52:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 20:52:45,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221476651] [2019-11-19 20:52:45,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:45,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:45,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502446538] [2019-11-19 20:52:45,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:45,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:45,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:45,350 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2019-11-19 20:52:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:46,241 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2019-11-19 20:52:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:46,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-19 20:52:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:46,254 INFO L225 Difference]: With dead ends: 5699 [2019-11-19 20:52:46,254 INFO L226 Difference]: Without dead ends: 2946 [2019-11-19 20:52:46,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-11-19 20:52:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2019-11-19 20:52:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-19 20:52:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2019-11-19 20:52:46,310 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2019-11-19 20:52:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:46,311 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2019-11-19 20:52:46,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2019-11-19 20:52:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-19 20:52:46,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:46,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:46,319 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2019-11-19 20:52:46,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:46,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435609669] [2019-11-19 20:52:46,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:46,529 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-19 20:52:46,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435609669] [2019-11-19 20:52:46,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:46,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:46,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071818100] [2019-11-19 20:52:46,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:46,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:46,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:46,533 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2019-11-19 20:52:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:46,974 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2019-11-19 20:52:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:46,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-19 20:52:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:46,987 INFO L225 Difference]: With dead ends: 5566 [2019-11-19 20:52:46,988 INFO L226 Difference]: Without dead ends: 2682 [2019-11-19 20:52:46,992 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-19 20:52:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-11-19 20:52:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2019-11-19 20:52:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-19 20:52:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2019-11-19 20:52:47,038 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2019-11-19 20:52:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:47,039 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2019-11-19 20:52:47,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2019-11-19 20:52:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-19 20:52:47,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:47,046 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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] [2019-11-19 20:52:47,047 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2019-11-19 20:52:47,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:47,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033169854] [2019-11-19 20:52:47,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 20:52:47,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033169854] [2019-11-19 20:52:47,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:47,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:47,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789488552] [2019-11-19 20:52:47,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:47,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:47,173 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2019-11-19 20:52:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:47,971 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2019-11-19 20:52:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:47,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-19 20:52:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:47,978 INFO L225 Difference]: With dead ends: 4780 [2019-11-19 20:52:47,979 INFO L226 Difference]: Without dead ends: 1634 [2019-11-19 20:52:47,983 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-19 20:52:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-19 20:52:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2019-11-19 20:52:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 20:52:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2019-11-19 20:52:48,007 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2019-11-19 20:52:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:48,008 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2019-11-19 20:52:48,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2019-11-19 20:52:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-19 20:52:48,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:48,014 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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] [2019-11-19 20:52:48,014 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2019-11-19 20:52:48,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:48,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956335540] [2019-11-19 20:52:48,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-19 20:52:48,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956335540] [2019-11-19 20:52:48,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:48,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:48,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877380641] [2019-11-19 20:52:48,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:52:48,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:52:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:48,441 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2019-11-19 20:52:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:49,011 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2019-11-19 20:52:49,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:49,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-11-19 20:52:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:49,017 INFO L225 Difference]: With dead ends: 3023 [2019-11-19 20:52:49,018 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 20:52:49,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 20:52:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 20:52:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 20:52:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2019-11-19 20:52:49,043 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2019-11-19 20:52:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:49,044 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2019-11-19 20:52:49,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:52:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2019-11-19 20:52:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-19 20:52:49,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:49,050 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:49,050 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2019-11-19 20:52:49,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:49,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812119054] [2019-11-19 20:52:49,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-19 20:52:50,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812119054] [2019-11-19 20:52:50,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324440603] [2019-11-19 20:52:50,072 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-19 20:52:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:50,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:52:50,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:52:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-19 20:52:50,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:52:50,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-19 20:52:50,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388475247] [2019-11-19 20:52:50,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:50,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 20:52:50,331 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 3 states. [2019-11-19 20:52:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:50,761 INFO L93 Difference]: Finished difference Result 1505 states and 1568 transitions. [2019-11-19 20:52:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:50,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-19 20:52:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:50,769 INFO L225 Difference]: With dead ends: 1505 [2019-11-19 20:52:50,769 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 20:52:50,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 20:52:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 20:52:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-19 20:52:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-19 20:52:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1430 transitions. [2019-11-19 20:52:50,801 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1430 transitions. Word has length 282 [2019-11-19 20:52:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:50,801 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1430 transitions. [2019-11-19 20:52:50,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1430 transitions. [2019-11-19 20:52:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-19 20:52:50,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:50,809 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:51,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:52:51,015 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:51,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2019-11-19 20:52:51,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:51,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903499188] [2019-11-19 20:52:51,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-19 20:52:51,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903499188] [2019-11-19 20:52:51,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:51,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223655445] [2019-11-19 20:52:51,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:52:51,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:52:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:51,633 INFO L87 Difference]: Start difference. First operand 1372 states and 1430 transitions. Second operand 5 states. [2019-11-19 20:52:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:52,181 INFO L93 Difference]: Finished difference Result 2631 states and 2747 transitions. [2019-11-19 20:52:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:52,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2019-11-19 20:52:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:52,182 INFO L225 Difference]: With dead ends: 2631 [2019-11-19 20:52:52,182 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:52:52,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:52:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:52:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:52:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:52:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:52:52,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2019-11-19 20:52:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:52,187 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:52:52,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:52:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:52:52,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:52:52,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:52:52,680 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-19 20:52:53,059 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-19 20:52:53,062 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-19 20:52:53,062 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-19 20:52:53,062 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,062 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,062 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-19 20:52:53,063 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,064 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-19 20:52:53,065 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,066 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-19 20:52:53,067 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-19 20:52:53,068 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-19 20:52:53,068 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-19 20:52:53,068 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-11-19 20:52:53,068 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-19 20:52:53,069 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-19 20:52:53,070 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-19 20:52:53,071 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-19 20:52:53,072 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-19 20:52:53,072 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-19 20:52:53,072 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-19 20:52:53,072 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-19 20:52:53,072 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,073 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-19 20:52:53,074 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-19 20:52:53,075 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-19 20:52:53,076 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-19 20:52:53,076 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-19 20:52:53,076 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-19 20:52:53,076 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-19 20:52:53,076 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,077 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-11-19 20:52:53,077 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,077 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,077 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,077 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-19 20:52:53,078 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,079 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-19 20:52:53,080 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-19 20:52:53,081 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,082 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-19 20:52:53,083 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-19 20:52:53,084 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,085 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,086 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,086 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,086 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-19 20:52:53,086 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,086 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-19 20:52:53,087 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:52:53,088 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,089 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-19 20:52:53,090 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-19 20:52:53,091 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-19 20:52:53,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:53 BoogieIcfgContainer [2019-11-19 20:52:53,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:52:53,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:52:53,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:52:53,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:52:53,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:36" (3/4) ... [2019-11-19 20:52:53,123 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:52:53,148 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:52:53,149 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:52:53,350 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:52:53,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:52:53,353 INFO L168 Benchmark]: Toolchain (without parser) took 19152.88 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 585.6 MB). Free memory was 952.3 MB in the beginning and 1.4 GB in the end (delta: -483.4 MB). Peak memory consumption was 102.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,353 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:52:53,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.43 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,354 INFO L168 Benchmark]: Boogie Preprocessor took 59.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:52:53,355 INFO L168 Benchmark]: RCFGBuilder took 1348.23 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: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,355 INFO L168 Benchmark]: TraceAbstraction took 16666.09 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.2 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.0 MB). Peak memory consumption was 600.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,356 INFO L168 Benchmark]: Witness Printer took 232.27 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:53,358 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.72 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 748.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.43 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1348.23 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: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16666.09 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.2 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.0 MB). Peak memory consumption was 600.4 MB. Max. memory is 11.5 GB. * Witness Printer took 232.27 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 16.5s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 1110 SDtfs, 2796 SDslu, 156 SDs, 0 SdLazy, 7086 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 499 HoareAnnotationTreeSize, 3 FomulaSimplifications, 858 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 294 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 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...