./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_label11.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 e09138f51265758a55ca4b42a17e715ba685a263 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:37,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:37,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:37,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:37,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:37,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:37,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:37,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:37,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:37,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:37,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:37,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:37,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:37,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:37,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:37,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:37,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:37,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:37,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:37,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:37,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:37,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:37,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:37,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:37,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:37,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:37,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:37,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:37,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:37,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:37,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:37,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:37,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:37,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:37,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:37,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:37,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:37,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:37,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:37,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:37,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:37,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:38,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:38,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:38,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:38,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:38,005 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:38,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:38,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:38,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:38,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:38,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:38,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:38,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:38,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:38,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:38,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:38,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:38,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:38,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:38,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:38,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:38,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:38,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:38,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:38,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:38,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:38,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:38,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:38,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:38,010 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 -> e09138f51265758a55ca4b42a17e715ba685a263 [2019-11-27 22:38:38,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:38,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:38,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:38,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:38,317 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:38,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2019-11-27 22:38:38,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01b0eba/c4e6ec43108847cc9ff87969003ebd4c/FLAG3e7240ac6 [2019-11-27 22:38:39,002 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:39,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2019-11-27 22:38:39,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01b0eba/c4e6ec43108847cc9ff87969003ebd4c/FLAG3e7240ac6 [2019-11-27 22:38:39,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df01b0eba/c4e6ec43108847cc9ff87969003ebd4c [2019-11-27 22:38:39,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:39,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:39,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:39,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:39,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:39,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:39,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164a7f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39, skipping insertion in model container [2019-11-27 22:38:39,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:39,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:39,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:39,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:39,663 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:39,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:39,885 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:39,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39 WrapperNode [2019-11-27 22:38:39,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:39,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:39,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:39,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:39,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:39,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:39,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:39,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:39,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:39,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:39,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:39,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (1/1) ... [2019-11-27 22:38:40,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:40,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:40,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:40,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:40,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (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-27 22:38:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:40,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:41,496 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:41,497 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:41,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:41 BoogieIcfgContainer [2019-11-27 22:38:41,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:41,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:41,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:41,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:41,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:39" (1/3) ... [2019-11-27 22:38:41,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7820c273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:41, skipping insertion in model container [2019-11-27 22:38:41,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:39" (2/3) ... [2019-11-27 22:38:41,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7820c273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:41, skipping insertion in model container [2019-11-27 22:38:41,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:41" (3/3) ... [2019-11-27 22:38:41,508 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2019-11-27 22:38:41,518 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:41,526 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:41,538 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:41,565 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:41,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:41,566 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:41,566 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:41,566 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:41,567 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:41,567 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:41,567 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-27 22:38:41,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:41,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:41,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1067563974, now seen corresponding path program 1 times [2019-11-27 22:38:41,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:41,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667882833] [2019-11-27 22:38:41,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:42,123 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-27 22:38:42,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667882833] [2019-11-27 22:38:42,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:42,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:42,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383061688] [2019-11-27 22:38:42,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:42,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:42,150 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-27 22:38:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:43,588 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-27 22:38:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:43,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-27 22:38:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:43,607 INFO L225 Difference]: With dead ends: 687 [2019-11-27 22:38:43,608 INFO L226 Difference]: Without dead ends: 397 [2019-11-27 22:38:43,612 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-27 22:38:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-27 22:38:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-27 22:38:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:38:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-27 22:38:43,673 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 109 [2019-11-27 22:38:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:43,674 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-27 22:38:43,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-27 22:38:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-27 22:38:43,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:43,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:43,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2122354963, now seen corresponding path program 1 times [2019-11-27 22:38:43,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:43,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070786661] [2019-11-27 22:38:43,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:43,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070786661] [2019-11-27 22:38:43,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:43,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:43,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938477745] [2019-11-27 22:38:43,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:43,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:43,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:43,805 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-27 22:38:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:44,669 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-27 22:38:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:44,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-27 22:38:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:44,675 INFO L225 Difference]: With dead ends: 1054 [2019-11-27 22:38:44,675 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:38:44,677 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-27 22:38:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:38:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-27 22:38:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:38:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-27 22:38:44,734 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 115 [2019-11-27 22:38:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:44,734 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-27 22:38:44,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-27 22:38:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-27 22:38:44,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:44,744 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:44,744 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -624347629, now seen corresponding path program 1 times [2019-11-27 22:38:44,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:44,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758447477] [2019-11-27 22:38:44,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:44,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758447477] [2019-11-27 22:38:44,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:44,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:44,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406069766] [2019-11-27 22:38:44,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:44,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:44,949 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 4 states. [2019-11-27 22:38:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:45,994 INFO L93 Difference]: Finished difference Result 2626 states and 3530 transitions. [2019-11-27 22:38:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:45,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-27 22:38:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:46,006 INFO L225 Difference]: With dead ends: 2626 [2019-11-27 22:38:46,007 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:38:46,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:38:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1183. [2019-11-27 22:38:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-27 22:38:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1495 transitions. [2019-11-27 22:38:46,063 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1495 transitions. Word has length 116 [2019-11-27 22:38:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:46,064 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1495 transitions. [2019-11-27 22:38:46,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1495 transitions. [2019-11-27 22:38:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-27 22:38:46,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:46,069 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:46,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -461914661, now seen corresponding path program 1 times [2019-11-27 22:38:46,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:46,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962243918] [2019-11-27 22:38:46,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:38:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962243918] [2019-11-27 22:38:46,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:46,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:46,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333423237] [2019-11-27 22:38:46,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:46,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:46,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:46,251 INFO L87 Difference]: Start difference. First operand 1183 states and 1495 transitions. Second operand 3 states. [2019-11-27 22:38:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:46,710 INFO L93 Difference]: Finished difference Result 2495 states and 3143 transitions. [2019-11-27 22:38:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:46,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-27 22:38:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:46,718 INFO L225 Difference]: With dead ends: 2495 [2019-11-27 22:38:46,718 INFO L226 Difference]: Without dead ends: 1314 [2019-11-27 22:38:46,720 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-27 22:38:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-27 22:38:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 921. [2019-11-27 22:38:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-27 22:38:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1119 transitions. [2019-11-27 22:38:46,748 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1119 transitions. Word has length 157 [2019-11-27 22:38:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:46,748 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1119 transitions. [2019-11-27 22:38:46,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1119 transitions. [2019-11-27 22:38:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:38:46,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:46,752 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:46,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1011749928, now seen corresponding path program 1 times [2019-11-27 22:38:46,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:46,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419257316] [2019-11-27 22:38:46,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-27 22:38:46,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419257316] [2019-11-27 22:38:46,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:46,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:46,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141586633] [2019-11-27 22:38:46,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:46,861 INFO L87 Difference]: Start difference. First operand 921 states and 1119 transitions. Second operand 3 states. [2019-11-27 22:38:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:47,358 INFO L93 Difference]: Finished difference Result 2364 states and 2880 transitions. [2019-11-27 22:38:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:47,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:38:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:47,364 INFO L225 Difference]: With dead ends: 2364 [2019-11-27 22:38:47,365 INFO L226 Difference]: Without dead ends: 1314 [2019-11-27 22:38:47,366 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-27 22:38:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-27 22:38:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-27 22:38:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-27 22:38:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1339 transitions. [2019-11-27 22:38:47,390 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1339 transitions. Word has length 193 [2019-11-27 22:38:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:47,391 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1339 transitions. [2019-11-27 22:38:47,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1339 transitions. [2019-11-27 22:38:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-27 22:38:47,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:47,395 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:47,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 875544516, now seen corresponding path program 1 times [2019-11-27 22:38:47,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:47,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679131804] [2019-11-27 22:38:47,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-27 22:38:47,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679131804] [2019-11-27 22:38:47,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:47,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:47,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181693038] [2019-11-27 22:38:47,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:47,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:47,508 INFO L87 Difference]: Start difference. First operand 1183 states and 1339 transitions. Second operand 4 states. [2019-11-27 22:38:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:48,119 INFO L93 Difference]: Finished difference Result 2500 states and 2823 transitions. [2019-11-27 22:38:48,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:48,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-27 22:38:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:48,125 INFO L225 Difference]: With dead ends: 2500 [2019-11-27 22:38:48,125 INFO L226 Difference]: Without dead ends: 1319 [2019-11-27 22:38:48,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-27 22:38:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-27 22:38:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-27 22:38:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1473 transitions. [2019-11-27 22:38:48,158 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1473 transitions. Word has length 201 [2019-11-27 22:38:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:48,158 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1473 transitions. [2019-11-27 22:38:48,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1473 transitions. [2019-11-27 22:38:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-27 22:38:48,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:48,163 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:38:48,164 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1359075188, now seen corresponding path program 1 times [2019-11-27 22:38:48,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:48,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115195499] [2019-11-27 22:38:48,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-27 22:38:48,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115195499] [2019-11-27 22:38:48,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:48,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:48,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37205930] [2019-11-27 22:38:48,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:38:48,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:38:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:48,325 INFO L87 Difference]: Start difference. First operand 1314 states and 1473 transitions. Second operand 5 states. [2019-11-27 22:38:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:49,295 INFO L93 Difference]: Finished difference Result 2757 states and 3105 transitions. [2019-11-27 22:38:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:49,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-11-27 22:38:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:49,303 INFO L225 Difference]: With dead ends: 2757 [2019-11-27 22:38:49,303 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:38:49,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:38:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-27 22:38:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:38:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1601 transitions. [2019-11-27 22:38:49,336 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1601 transitions. Word has length 205 [2019-11-27 22:38:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:49,336 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1601 transitions. [2019-11-27 22:38:49,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:38:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1601 transitions. [2019-11-27 22:38:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-27 22:38:49,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:49,342 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-27 22:38:49,342 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash -730744691, now seen corresponding path program 1 times [2019-11-27 22:38:49,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:49,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410363649] [2019-11-27 22:38:49,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-27 22:38:49,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410363649] [2019-11-27 22:38:49,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:49,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:49,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109140305] [2019-11-27 22:38:49,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:49,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:49,449 INFO L87 Difference]: Start difference. First operand 1445 states and 1601 transitions. Second operand 3 states. [2019-11-27 22:38:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:49,867 INFO L93 Difference]: Finished difference Result 3412 states and 3806 transitions. [2019-11-27 22:38:49,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:49,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-27 22:38:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:49,873 INFO L225 Difference]: With dead ends: 3412 [2019-11-27 22:38:49,873 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:49,876 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-27 22:38:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-27 22:38:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:38:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1873 transitions. [2019-11-27 22:38:49,908 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1873 transitions. Word has length 223 [2019-11-27 22:38:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:49,909 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1873 transitions. [2019-11-27 22:38:49,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1873 transitions. [2019-11-27 22:38:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-27 22:38:49,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:49,915 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:49,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash -604904935, now seen corresponding path program 1 times [2019-11-27 22:38:49,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:49,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402664876] [2019-11-27 22:38:49,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-27 22:38:50,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402664876] [2019-11-27 22:38:50,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129833527] [2019-11-27 22:38:50,179 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-27 22:38:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:50,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:50,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-27 22:38:50,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:50,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 22:38:50,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250075921] [2019-11-27 22:38:50,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:50,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:50,516 INFO L87 Difference]: Start difference. First operand 1707 states and 1873 transitions. Second operand 3 states. [2019-11-27 22:38:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:51,120 INFO L93 Difference]: Finished difference Result 3410 states and 3761 transitions. [2019-11-27 22:38:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:51,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-27 22:38:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:51,122 INFO L225 Difference]: With dead ends: 3410 [2019-11-27 22:38:51,122 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:38:51,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:38:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:38:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:38:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:38:51,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2019-11-27 22:38:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:51,127 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:38:51,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:38:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:38:51,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:51,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:38:51,578 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-27 22:38:51,746 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-11-27 22:38:51,750 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:38:51,751 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:38:51,751 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,751 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,751 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,751 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,752 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,752 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,755 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:38:51,756 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:38:51,756 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:38:51,756 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:38:51,756 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:38:51,756 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,757 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,758 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,758 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,758 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,760 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,761 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:38:51,762 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:38:51,762 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:38:51,762 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:38:51,762 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:38:51,763 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:38:51,764 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:38:51,764 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:38:51,764 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:38:51,764 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:38:51,764 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,765 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,765 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,765 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,765 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,766 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:38:51,766 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:38:51,767 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:38:51,767 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:38:51,767 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:38:51,767 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:38:51,768 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:38:51,768 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:38:51,768 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:38:51,769 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)) (and (or (and .cse0 .cse3 .cse1) (and .cse0 .cse4 .cse1)) .cse5) (and .cse3 .cse4 .cse1 .cse5))) [2019-11-27 22:38:51,769 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,769 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,769 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,770 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,770 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,770 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:38:51,770 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:38:51,771 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:38:51,771 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:38:51,771 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:38:51,771 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:38:51,771 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:38:51,772 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:38:51,772 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:38:51,772 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:38:51,772 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:38:51,772 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:38:51,773 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:38:51,773 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:38:51,773 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,773 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,774 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,774 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,774 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,774 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:38:51,775 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:38:51,775 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:38:51,775 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:38:51,776 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:38:51,776 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:38:51,776 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:38:51,776 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:38:51,776 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:38:51,777 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,777 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,777 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,777 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,778 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:38:51,778 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,778 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:38:51,778 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:38:51,779 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:38:51,779 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:38:51,779 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:38:51,779 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:38:51,780 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:38:51,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:38:51,780 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:38:51,780 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:38:51,781 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:38:51,781 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:38:51,781 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:38:51,781 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:38:51,782 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,783 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)) (and (or (and .cse0 .cse3 .cse1) (and .cse0 .cse4 .cse1)) .cse5) (and .cse3 .cse4 .cse1 .cse5))) [2019-11-27 22:38:51,784 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,784 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,784 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,784 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,784 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:38:51,785 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:38:51,785 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:38:51,785 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:38:51,785 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:38:51,785 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,786 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:38:51,787 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:38:51,788 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:38:51,788 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:38:51,788 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:38:51,790 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:38:51,791 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:38:51,791 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:38:51,791 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:38:51,792 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,792 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,792 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,792 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,793 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:38:51,793 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,793 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,793 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:38:51,793 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:38:51,794 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:38:51,794 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:38:51,794 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:38:51,796 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:38:51,796 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:38:51,796 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:38:51,796 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:38:51,797 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:38:51,797 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:38:51,797 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:38:51,797 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:38:51,797 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,798 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,798 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,798 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,798 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,798 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:38:51,799 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,799 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:38:51,799 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:38:51,799 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:38:51,800 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:38:51,800 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:38:51,800 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:38:51,800 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:38:51,801 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:38:51,801 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:38:51,801 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:38:51,802 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:38:51,802 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:38:51,802 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2019-11-27 22:38:51,802 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:38:51,802 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:38:51,803 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:38:51,803 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,803 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,804 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,804 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,804 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,804 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:51,805 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:38:51,805 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:38:51,805 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:38:51,805 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:38:51,806 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:38:51,806 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:38:51,806 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:38:51,806 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:38:51,807 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:38:51,807 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:38:51,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:38:51 BoogieIcfgContainer [2019-11-27 22:38:51,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:38:51,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:38:51,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:38:51,855 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:38:51,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:41" (3/4) ... [2019-11-27 22:38:51,860 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:38:51,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:38:51,901 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:38:52,129 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:38:52,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:38:52,131 INFO L168 Benchmark]: Toolchain (without parser) took 12918.50 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.8 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -197.6 MB). Peak memory consumption was 229.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,131 INFO L168 Benchmark]: CDTParser took 0.33 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-27 22:38:52,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,133 INFO L168 Benchmark]: Boogie Preprocessor took 71.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,133 INFO L168 Benchmark]: RCFGBuilder took 1441.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.9 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,134 INFO L168 Benchmark]: TraceAbstraction took 10354.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 985.9 MB in the beginning and 1.2 GB in the end (delta: -184.1 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,134 INFO L168 Benchmark]: Witness Printer took 274.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:52,137 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.33 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 669.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1441.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.9 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10354.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 985.9 MB in the beginning and 1.2 GB in the end (delta: -184.1 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. * Witness Printer took 274.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((((!(a16 == 6) && !(1 == a7)) && a21 == 1) || ((!(a16 == 6) && !(14 == a8)) && a21 == 1)) && a20 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || ((((!(a16 == 6) && !(1 == a7)) && a21 == 1) || ((!(a16 == 6) && !(14 == a8)) && a21 == 1)) && a20 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.7s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 471 SDtfs, 1845 SDslu, 90 SDs, 0 SdLazy, 4393 SolverSat, 682 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1708 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 169 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2107 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 758 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1823 NumberOfCodeBlocks, 1823 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1813 ConstructedInterpolants, 0 QuantifiedInterpolants, 737947 SizeOfPredicates, 1 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1490/1517 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...