./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label04.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_label04.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 3774d82389353be2170e26cc4e53c0d06e3cb94d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:52:31,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:52:31,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:52:31,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:52:31,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:52:31,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:52:31,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:52:31,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:52:31,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:52:31,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:52:31,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:52:31,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:52:31,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:52:31,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:52:31,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:52:31,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:52:31,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:52:31,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:52:31,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:52:31,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:52:31,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:52:31,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:52:31,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:52:31,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:52:31,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:52:31,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:52:31,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:52:31,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:52:31,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:52:31,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:52:31,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:52:31,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:52:31,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:52:31,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:52:31,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:52:31,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:52:31,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:52:31,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:52:31,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:52:31,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:52:31,943 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:31,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:52:31,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:52:31,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:52:31,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:52:31,988 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:52:31,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:52:31,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:52:31,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:52:31,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:52:31,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:52:31,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:52:31,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:52:31,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:52:31,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:52:31,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:52:31,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:52:31,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:52:31,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:52:31,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:52:31,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:52:31,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:52:31,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:31,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:52:31,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:52:31,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:52:31,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:52:31,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:52:31,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:52:31,997 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 -> 3774d82389353be2170e26cc4e53c0d06e3cb94d [2019-11-19 20:52:32,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:52:32,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:52:32,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:52:32,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:52:32,368 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:52:32,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2019-11-19 20:52:32,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1762a7e60/989622a8493546f89350a04885395203/FLAG220c88fc6 [2019-11-19 20:52:32,954 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:52:32,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2019-11-19 20:52:32,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1762a7e60/989622a8493546f89350a04885395203/FLAG220c88fc6 [2019-11-19 20:52:33,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1762a7e60/989622a8493546f89350a04885395203 [2019-11-19 20:52:33,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:52:33,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:52:33,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:33,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:52:33,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:52:33,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:33" (1/1) ... [2019-11-19 20:52:33,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565eff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:33, skipping insertion in model container [2019-11-19 20:52:33,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:33" (1/1) ... [2019-11-19 20:52:33,303 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:52:33,370 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:52:33,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:33,951 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:52:34,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:34,108 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:52:34,108 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,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:34,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:34,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:52:34,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:52:34,116 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,134 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:34,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:34,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:52:34,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:52:34,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:52:34,208 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:34,209 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:34,213 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:34,214 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:34,237 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:34,253 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:34,270 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:34,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:52:34,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:52:34,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:52:34,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:52:34,294 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:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:52:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:52:35,506 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:52:35,507 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:52:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:35 BoogieIcfgContainer [2019-11-19 20:52:35,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:52:35,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:52:35,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:52:35,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:52:35,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:33" (1/3) ... [2019-11-19 20:52:35,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57847753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:35, skipping insertion in model container [2019-11-19 20:52:35,516 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:35,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57847753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:35, skipping insertion in model container [2019-11-19 20:52:35,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:35" (3/3) ... [2019-11-19 20:52:35,519 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c [2019-11-19 20:52:35,529 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:52:35,538 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:52:35,550 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:52:35,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:52:35,579 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:52:35,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:52:35,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:52:35,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:52:35,580 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:52:35,581 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:52:35,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:52:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-19 20:52:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 20:52:35,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:35,617 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] [2019-11-19 20:52:35,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash 857742575, now seen corresponding path program 1 times [2019-11-19 20:52:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:35,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367069183] [2019-11-19 20:52:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:36,170 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:36,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367069183] [2019-11-19 20:52:36,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:36,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:36,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751607087] [2019-11-19 20:52:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:36,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:36,199 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-19 20:52:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:37,684 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-19 20:52:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:37,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-19 20:52:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:37,716 INFO L225 Difference]: With dead ends: 662 [2019-11-19 20:52:37,717 INFO L226 Difference]: Without dead ends: 397 [2019-11-19 20:52:37,727 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:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-19 20:52:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-19 20:52:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-19 20:52:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-19 20:52:37,839 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 96 [2019-11-19 20:52:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:37,841 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-19 20:52:37,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-19 20:52:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 20:52:37,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:37,851 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 20:52:37,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2104593095, now seen corresponding path program 1 times [2019-11-19 20:52:37,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:37,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909833472] [2019-11-19 20:52:37,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:37,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909833472] [2019-11-19 20:52:37,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:37,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:37,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346887523] [2019-11-19 20:52:37,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:37,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:37,911 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-19 20:52:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:38,554 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-19 20:52:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:38,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 20:52:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:38,562 INFO L225 Difference]: With dead ends: 1185 [2019-11-19 20:52:38,562 INFO L226 Difference]: Without dead ends: 790 [2019-11-19 20:52:38,564 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:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-19 20:52:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-19 20:52:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-19 20:52:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-19 20:52:38,592 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 101 [2019-11-19 20:52:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-19 20:52:38,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-19 20:52:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 20:52:38,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:38,598 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-19 20:52:38,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2133421455, now seen corresponding path program 1 times [2019-11-19 20:52:38,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:38,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74406739] [2019-11-19 20:52:38,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 20:52:38,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74406739] [2019-11-19 20:52:38,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:38,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:38,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709575859] [2019-11-19 20:52:38,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:38,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:38,678 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-19 20:52:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:39,172 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-19 20:52:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:39,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 20:52:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:39,179 INFO L225 Difference]: With dead ends: 1971 [2019-11-19 20:52:39,179 INFO L226 Difference]: Without dead ends: 1183 [2019-11-19 20:52:39,181 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,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-19 20:52:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-19 20:52:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-19 20:52:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-19 20:52:39,208 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 122 [2019-11-19 20:52:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:39,209 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-19 20:52:39,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-19 20:52:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 20:52:39,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:39,213 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:39,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1539851884, now seen corresponding path program 1 times [2019-11-19 20:52:39,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:39,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519637709] [2019-11-19 20:52:39,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-19 20:52:39,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519637709] [2019-11-19 20:52:39,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:39,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:39,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327432309] [2019-11-19 20:52:39,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:39,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:39,338 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-19 20:52:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:39,854 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-19 20:52:39,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:39,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-19 20:52:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:39,862 INFO L225 Difference]: With dead ends: 2233 [2019-11-19 20:52:39,863 INFO L226 Difference]: Without dead ends: 1314 [2019-11-19 20:52:39,865 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,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-19 20:52:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-19 20:52:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-19 20:52:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-19 20:52:39,904 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 158 [2019-11-19 20:52:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:39,905 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-19 20:52:39,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-19 20:52:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-19 20:52:39,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:39,910 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:39,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2022693764, now seen corresponding path program 1 times [2019-11-19 20:52:39,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:39,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290528550] [2019-11-19 20:52:39,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-19 20:52:40,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290528550] [2019-11-19 20:52:40,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:40,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:40,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328383182] [2019-11-19 20:52:40,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:40,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:40,085 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-19 20:52:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:40,600 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-19 20:52:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:40,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-19 20:52:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:40,614 INFO L225 Difference]: With dead ends: 3150 [2019-11-19 20:52:40,614 INFO L226 Difference]: Without dead ends: 1969 [2019-11-19 20:52:40,617 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:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-19 20:52:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-19 20:52:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-19 20:52:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-11-19 20:52:40,656 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 177 [2019-11-19 20:52:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:40,657 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-11-19 20:52:40,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-11-19 20:52:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-19 20:52:40,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:40,663 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 20:52:40,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:40,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash -442422933, now seen corresponding path program 1 times [2019-11-19 20:52:40,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:40,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016389952] [2019-11-19 20:52:40,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-19 20:52:40,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016389952] [2019-11-19 20:52:40,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:40,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:40,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180557569] [2019-11-19 20:52:40,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:40,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:40,745 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-11-19 20:52:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:41,255 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-11-19 20:52:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:41,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-19 20:52:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:41,266 INFO L225 Difference]: With dead ends: 3412 [2019-11-19 20:52:41,266 INFO L226 Difference]: Without dead ends: 1838 [2019-11-19 20:52:41,269 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,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-19 20:52:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-19 20:52:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-19 20:52:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-11-19 20:52:41,307 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 180 [2019-11-19 20:52:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:41,308 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-11-19 20:52:41,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-11-19 20:52:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-19 20:52:41,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:41,314 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 20:52:41,314 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash 570545059, now seen corresponding path program 1 times [2019-11-19 20:52:41,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:41,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436229142] [2019-11-19 20:52:41,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-19 20:52:41,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436229142] [2019-11-19 20:52:41,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:41,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 20:52:41,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915376982] [2019-11-19 20:52:41,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 20:52:41,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 20:52:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:52:41,514 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-11-19 20:52:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:42,790 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-11-19 20:52:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 20:52:42,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-11-19 20:52:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:42,800 INFO L225 Difference]: With dead ends: 3841 [2019-11-19 20:52:42,800 INFO L226 Difference]: Without dead ends: 2005 [2019-11-19 20:52:42,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:52:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-19 20:52:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-11-19 20:52:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-19 20:52:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-11-19 20:52:42,842 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 184 [2019-11-19 20:52:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:42,843 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-11-19 20:52:42,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 20:52:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-11-19 20:52:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-19 20:52:42,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:42,849 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:52:42,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 540380915, now seen corresponding path program 1 times [2019-11-19 20:52:42,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:42,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668035722] [2019-11-19 20:52:42,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-19 20:52:42,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668035722] [2019-11-19 20:52:42,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:42,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:42,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779239678] [2019-11-19 20:52:42,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:42,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:42,993 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-11-19 20:52:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:43,779 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-11-19 20:52:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:43,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-19 20:52:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:43,789 INFO L225 Difference]: With dead ends: 3936 [2019-11-19 20:52:43,789 INFO L226 Difference]: Without dead ends: 2100 [2019-11-19 20:52:43,792 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:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-19 20:52:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-19 20:52:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-19 20:52:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-11-19 20:52:43,828 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 217 [2019-11-19 20:52:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:43,829 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-11-19 20:52:43,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-11-19 20:52:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-19 20:52:43,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:43,836 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-19 20:52:43,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1041196455, now seen corresponding path program 1 times [2019-11-19 20:52:43,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:43,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995666253] [2019-11-19 20:52:43,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-19 20:52:44,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995666253] [2019-11-19 20:52:44,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:44,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:44,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024271802] [2019-11-19 20:52:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:44,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:44,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:44,025 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-11-19 20:52:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:44,721 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-11-19 20:52:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:44,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-19 20:52:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:44,730 INFO L225 Difference]: With dead ends: 4460 [2019-11-19 20:52:44,731 INFO L226 Difference]: Without dead ends: 2493 [2019-11-19 20:52:44,733 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:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-19 20:52:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-19 20:52:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-19 20:52:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-19 20:52:44,771 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 243 [2019-11-19 20:52:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:44,772 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-19 20:52:44,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-19 20:52:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-19 20:52:44,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:44,780 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 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, 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] [2019-11-19 20:52:44,780 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1832313326, now seen corresponding path program 1 times [2019-11-19 20:52:44,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:44,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540101096] [2019-11-19 20:52:44,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-19 20:52:44,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540101096] [2019-11-19 20:52:44,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:44,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:52:44,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021512733] [2019-11-19 20:52:44,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 20:52:44,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:52:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:52:44,948 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-19 20:52:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:45,814 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-19 20:52:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:52:45,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-11-19 20:52:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:45,825 INFO L225 Difference]: With dead ends: 4105 [2019-11-19 20:52:45,826 INFO L226 Difference]: Without dead ends: 2138 [2019-11-19 20:52:45,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:52:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-19 20:52:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-19 20:52:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-19 20:52:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-19 20:52:45,887 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 264 [2019-11-19 20:52:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:45,896 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-19 20:52:45,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 20:52:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-19 20:52:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-19 20:52:45,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:45,910 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 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, 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] [2019-11-19 20:52:45,911 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1089791849, now seen corresponding path program 1 times [2019-11-19 20:52:45,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:45,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572712611] [2019-11-19 20:52:45,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-19 20:52:47,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572712611] [2019-11-19 20:52:47,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371350422] [2019-11-19 20:52:47,534 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:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:47,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:52:47,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:52:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-19 20:52:47,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:52:47,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-19 20:52:47,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561698392] [2019-11-19 20:52:47,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:47,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:47,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:47,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 20:52:47,879 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-19 20:52:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:48,391 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-19 20:52:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:48,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-11-19 20:52:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:48,392 INFO L225 Difference]: With dead ends: 3672 [2019-11-19 20:52:48,392 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:52:48,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 20:52:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:52:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:52:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:52:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:52:48,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 286 [2019-11-19 20:52:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:48,398 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:52:48,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:52:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:52:48,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:52:48,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:52:48,730 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 76 [2019-11-19 20:52:49,130 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-11-19 20:52:49,464 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-11-19 20:52:49,468 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-19 20:52:49,468 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-19 20:52:49,468 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,468 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,468 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-19 20:52:49,469 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-19 20:52:49,470 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 20:52:49,470 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-19 20:52:49,470 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,471 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-19 20:52:49,472 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-19 20:52:49,473 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-19 20:52:49,473 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-19 20:52:49,473 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-19 20:52:49,473 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-19 20:52:49,473 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,474 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-19 20:52:49,475 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-19 20:52:49,476 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-19 20:52:49,476 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-19 20:52:49,476 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-19 20:52:49,476 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-19 20:52:49,476 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-19 20:52:49,479 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (<= ~a21~0 0)) (.cse2 (= ~a16~0 4)) (.cse5 (not (= ~a7~0 1))) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a21~0 1))) (or (and .cse0 (= 5 ~a16~0)) (and .cse1 .cse2 (<= ~a17~0 0)) (and .cse1 .cse3) (and .cse1 .cse4) (and .cse5 .cse0 (= 15 ~a8~0) .cse3) (and .cse2 .cse0 (not .cse4)) (and .cse5 (not .cse3) .cse4 .cse0) (and .cse4 .cse0 (= ~a20~0 1)))) [2019-11-19 20:52:49,479 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,479 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,479 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,479 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-19 20:52:49,480 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,481 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,482 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-19 20:52:49,483 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-19 20:52:49,484 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:52:49,484 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-19 20:52:49,486 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a21~0 0)) (.cse2 (= ~a16~0 4)) (.cse5 (not (= ~a7~0 1))) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a21~0 1))) (or (and .cse0 (= 5 ~a16~0)) (and .cse1 .cse2 (<= ~a17~0 0)) (and .cse1 .cse3) (and .cse1 .cse4) (and .cse5 .cse0 (= 15 ~a8~0) .cse3) (and .cse2 .cse0 (not .cse4)) (and .cse5 (not .cse3) .cse4 .cse0) (and .cse4 .cse0 (= ~a20~0 1)))) [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-19 20:52:49,487 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,488 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,493 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,493 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-19 20:52:49,493 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-19 20:52:49,494 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,495 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,496 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-19 20:52:49,497 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-19 20:52:49,498 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-19 20:52:49,499 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-19 20:52:49,500 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-19 20:52:49,501 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,502 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-19 20:52:49,503 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-19 20:52:49,504 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-19 20:52:49,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:49 BoogieIcfgContainer [2019-11-19 20:52:49,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:52:49,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:52:49,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:52:49,541 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:52:49,541 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:35" (3/4) ... [2019-11-19 20:52:49,546 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:52:49,589 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:52:49,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:52:49,798 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:52:49,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:52:49,800 INFO L168 Benchmark]: Toolchain (without parser) took 16521.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 956.3 MB in the beginning and 910.8 MB in the end (delta: 45.5 MB). Peak memory consumption was 445.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,800 INFO L168 Benchmark]: CDTParser took 0.26 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:49,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,801 INFO L168 Benchmark]: Boogie Preprocessor took 95.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,802 INFO L168 Benchmark]: RCFGBuilder took 1216.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 964.2 MB in the end (delta: 113.5 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,802 INFO L168 Benchmark]: TraceAbstraction took 14029.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 964.2 MB in the beginning and 935.1 MB in the end (delta: 29.1 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,803 INFO L168 Benchmark]: Witness Printer took 257.93 ms. Allocated memory is still 1.4 GB. Free memory was 935.1 MB in the beginning and 910.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:52:49,805 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.26 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 824.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1216.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 964.2 MB in the end (delta: 113.5 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14029.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 964.2 MB in the beginning and 935.1 MB in the end (delta: 29.1 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. * Witness Printer took 257.93 ms. Allocated memory is still 1.4 GB. Free memory was 935.1 MB in the beginning and 910.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 464]: 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: (((((((a21 == 1 && 5 == a16) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (a21 <= 0 && a17 == 1)) || (((!(a7 == 1) && a21 == 1) && 15 == a8) && a16 == 6)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a21 == 1 && 5 == a16) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (a21 <= 0 && a17 == 1)) || (((!(a7 == 1) && a21 == 1) && 15 == a8) && a16 == 6)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.9s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 951 SDtfs, 2116 SDslu, 125 SDs, 0 SdLazy, 5932 SolverSat, 913 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred 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, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 165 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8152 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2388 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2314 NumberOfCodeBlocks, 2314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674077 SizeOfPredicates, 1 NumberOfNonLiveVariables, 517 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...