./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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/loop-invgen/apache-get-tag.i.v+nlh-reducer.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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:51:31,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:51:31,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:51:31,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:51:31,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:51:31,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:51:31,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:51:31,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:51:31,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:51:31,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:51:31,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:51:31,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:51:31,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:51:31,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:51:31,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:51:31,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:51:31,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:51:31,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:51:31,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:51:31,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:51:31,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:51:31,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:51:31,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:51:31,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:51:31,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:51:31,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:51:31,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:51:31,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:51:31,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:51:31,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:51:31,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:51:31,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:51:31,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:51:31,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:51:31,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:51:31,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:51:31,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:51:31,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:51:31,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:51:31,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:51:31,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:51:31,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:51:31,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:51:31,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:51:31,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:51:31,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:51:31,925 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:51:31,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:51:31,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:51:31,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:51:31,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:51:31,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:51:31,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:51:31,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:51:31,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:51:31,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:51:31,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:51:31,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:51:31,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:51:31,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:51:31,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:51:31,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:51:31,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:51:31,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:51:31,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:51:31,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:51:31,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:51:31,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:51:31,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:51:31,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:51:31,933 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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-11-19 18:51:32,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:51:32,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:51:32,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:51:32,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:51:32,263 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:51:32,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-19 18:51:32,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3ceaf1c/8118ac9fb9f14ea8bb5eace3266eca8d/FLAGf9efde721 [2019-11-19 18:51:32,733 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:51:32,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-19 18:51:32,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3ceaf1c/8118ac9fb9f14ea8bb5eace3266eca8d/FLAGf9efde721 [2019-11-19 18:51:33,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3ceaf1c/8118ac9fb9f14ea8bb5eace3266eca8d [2019-11-19 18:51:33,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:51:33,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:51:33,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:51:33,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:51:33,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:51:33,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33, skipping insertion in model container [2019-11-19 18:51:33,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,158 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:51:33,193 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:51:33,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:51:33,515 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:51:33,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:51:33,666 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:51:33,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33 WrapperNode [2019-11-19 18:51:33,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:51:33,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:51:33,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:51:33,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:51:33,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:51:33,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:51:33,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:51:33,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:51:33,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... [2019-11-19 18:51:33,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:51:33,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:51:33,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:51:33,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:51:33,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:51:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:51:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:51:34,235 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:51:34,235 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 18:51:34,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:34 BoogieIcfgContainer [2019-11-19 18:51:34,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:51:34,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:51:34,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:51:34,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:51:34,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:51:33" (1/3) ... [2019-11-19 18:51:34,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d6d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:34, skipping insertion in model container [2019-11-19 18:51:34,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:33" (2/3) ... [2019-11-19 18:51:34,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d6d2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:34, skipping insertion in model container [2019-11-19 18:51:34,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:34" (3/3) ... [2019-11-19 18:51:34,249 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-19 18:51:34,258 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:51:34,266 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-19 18:51:34,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-19 18:51:34,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:51:34,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:51:34,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:51:34,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:51:34,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:51:34,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:51:34,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:51:34,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:51:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-19 18:51:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 18:51:34,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:34,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:34,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-11-19 18:51:34,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:34,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518909366] [2019-11-19 18:51:34,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:34,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518909366] [2019-11-19 18:51:34,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:34,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:34,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027511254] [2019-11-19 18:51:34,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:34,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:34,552 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-11-19 18:51:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:34,749 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2019-11-19 18:51:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:34,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-19 18:51:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:34,767 INFO L225 Difference]: With dead ends: 130 [2019-11-19 18:51:34,767 INFO L226 Difference]: Without dead ends: 109 [2019-11-19 18:51:34,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-19 18:51:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-11-19 18:51:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 18:51:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-19 18:51:34,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-11-19 18:51:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:34,827 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-19 18:51:34,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-19 18:51:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 18:51:34,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:34,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:34,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-11-19 18:51:34,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:34,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120853694] [2019-11-19 18:51:34,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:34,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120853694] [2019-11-19 18:51:34,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:34,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476528800] [2019-11-19 18:51:34,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:34,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:34,877 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-11-19 18:51:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:34,965 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-19 18:51:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:34,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-19 18:51:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:34,968 INFO L225 Difference]: With dead ends: 65 [2019-11-19 18:51:34,968 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 18:51:34,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 18:51:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 18:51:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-19 18:51:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 18:51:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-19 18:51:34,977 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-11-19 18:51:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:34,977 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-19 18:51:34,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-19 18:51:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 18:51:34,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:34,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:34,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-11-19 18:51:34,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:34,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367496738] [2019-11-19 18:51:34,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367496738] [2019-11-19 18:51:35,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:35,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486733142] [2019-11-19 18:51:35,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:35,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:35,025 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-19 18:51:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:35,116 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-19 18:51:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:35,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-19 18:51:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:35,121 INFO L225 Difference]: With dead ends: 69 [2019-11-19 18:51:35,121 INFO L226 Difference]: Without dead ends: 67 [2019-11-19 18:51:35,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 18:51:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-19 18:51:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-19 18:51:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 18:51:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-19 18:51:35,135 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-11-19 18:51:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:35,136 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-19 18:51:35,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-19 18:51:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:51:35,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:35,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:35,139 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-11-19 18:51:35,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:35,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8523987] [2019-11-19 18:51:35,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8523987] [2019-11-19 18:51:35,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:35,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472730059] [2019-11-19 18:51:35,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:35,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:35,239 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-19 18:51:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:35,332 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-19 18:51:35,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:35,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 18:51:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:35,335 INFO L225 Difference]: With dead ends: 66 [2019-11-19 18:51:35,335 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 18:51:35,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 18:51:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-19 18:51:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 18:51:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-19 18:51:35,351 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-11-19 18:51:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:35,352 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-19 18:51:35,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-19 18:51:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 18:51:35,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:35,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:35,354 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-11-19 18:51:35,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505029021] [2019-11-19 18:51:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505029021] [2019-11-19 18:51:35,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:35,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308453775] [2019-11-19 18:51:35,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:35,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:35,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:35,431 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-19 18:51:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:35,531 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-19 18:51:35,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:35,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 18:51:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:35,532 INFO L225 Difference]: With dead ends: 65 [2019-11-19 18:51:35,533 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 18:51:35,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 18:51:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-19 18:51:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 18:51:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-19 18:51:35,539 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-11-19 18:51:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-19 18:51:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-19 18:51:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:51:35,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:35,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:35,542 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-11-19 18:51:35,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647597218] [2019-11-19 18:51:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647597218] [2019-11-19 18:51:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58385364] [2019-11-19 18:51:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:35,604 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-19 18:51:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:35,677 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-19 18:51:35,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:35,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 18:51:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:35,679 INFO L225 Difference]: With dead ends: 63 [2019-11-19 18:51:35,679 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:51:35,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:51:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-19 18:51:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 18:51:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-19 18:51:35,686 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-11-19 18:51:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:35,687 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-19 18:51:35,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-19 18:51:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:51:35,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:35,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:35,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-11-19 18:51:35,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:35,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688390066] [2019-11-19 18:51:35,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688390066] [2019-11-19 18:51:35,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:35,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632157933] [2019-11-19 18:51:35,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:35,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:35,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:35,772 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-11-19 18:51:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:35,887 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-11-19 18:51:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:35,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-19 18:51:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:35,888 INFO L225 Difference]: With dead ends: 100 [2019-11-19 18:51:35,888 INFO L226 Difference]: Without dead ends: 98 [2019-11-19 18:51:35,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-19 18:51:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-11-19 18:51:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 18:51:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-19 18:51:35,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-11-19 18:51:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:35,908 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-19 18:51:35,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-19 18:51:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:51:35,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:35,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:35,909 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-11-19 18:51:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828242889] [2019-11-19 18:51:35,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:35,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828242889] [2019-11-19 18:51:35,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:35,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:35,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185258591] [2019-11-19 18:51:35,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:35,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:35,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:35,963 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-11-19 18:51:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,026 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-19 18:51:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:36,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 18:51:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,028 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:51:36,028 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 18:51:36,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 18:51:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 18:51:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-19 18:51:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 18:51:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-19 18:51:36,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-11-19 18:51:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,035 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-19 18:51:36,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-19 18:51:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:51:36,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,037 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-11-19 18:51:36,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411923647] [2019-11-19 18:51:36,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411923647] [2019-11-19 18:51:36,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:36,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728084354] [2019-11-19 18:51:36,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:36,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:36,125 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-19 18:51:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,241 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-19 18:51:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:51:36,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-19 18:51:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,243 INFO L225 Difference]: With dead ends: 91 [2019-11-19 18:51:36,243 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 18:51:36,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 18:51:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-11-19 18:51:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 18:51:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-19 18:51:36,259 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-11-19 18:51:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,259 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-19 18:51:36,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-19 18:51:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:51:36,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,263 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-11-19 18:51:36,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85802519] [2019-11-19 18:51:36,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85802519] [2019-11-19 18:51:36,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:36,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761783909] [2019-11-19 18:51:36,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:36,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:36,322 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-19 18:51:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,407 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-19 18:51:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:36,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-19 18:51:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,411 INFO L225 Difference]: With dead ends: 68 [2019-11-19 18:51:36,411 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 18:51:36,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 18:51:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-11-19 18:51:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 18:51:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-19 18:51:36,421 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-11-19 18:51:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,421 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-19 18:51:36,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-19 18:51:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:51:36,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-11-19 18:51:36,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727770489] [2019-11-19 18:51:36,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727770489] [2019-11-19 18:51:36,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:51:36,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670228803] [2019-11-19 18:51:36,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:51:36,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:51:36,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:36,510 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-19 18:51:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,585 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-19 18:51:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:36,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-19 18:51:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,587 INFO L225 Difference]: With dead ends: 49 [2019-11-19 18:51:36,587 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 18:51:36,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 18:51:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-19 18:51:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 18:51:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-19 18:51:36,594 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-11-19 18:51:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,594 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-19 18:51:36,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:51:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-19 18:51:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:51:36,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-11-19 18:51:36,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081839691] [2019-11-19 18:51:36,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081839691] [2019-11-19 18:51:36,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:36,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986392316] [2019-11-19 18:51:36,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:36,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:36,681 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-19 18:51:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,742 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-19 18:51:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:51:36,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-19 18:51:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,743 INFO L225 Difference]: With dead ends: 46 [2019-11-19 18:51:36,743 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 18:51:36,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 18:51:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-19 18:51:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 18:51:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-19 18:51:36,747 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-19 18:51:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,747 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-19 18:51:36,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-19 18:51:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:51:36,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,749 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-11-19 18:51:36,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509238147] [2019-11-19 18:51:36,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509238147] [2019-11-19 18:51:36,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 18:51:36,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655483673] [2019-11-19 18:51:36,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 18:51:36,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 18:51:36,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 18:51:36,820 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-19 18:51:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:36,895 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-19 18:51:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:51:36,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-19 18:51:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:36,896 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:51:36,896 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 18:51:36,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 18:51:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-11-19 18:51:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 18:51:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-19 18:51:36,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-19 18:51:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:36,902 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-19 18:51:36,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 18:51:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-19 18:51:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:51:36,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:36,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:36,904 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-11-19 18:51:36,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:36,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313963633] [2019-11-19 18:51:36,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313963633] [2019-11-19 18:51:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:51:36,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927270241] [2019-11-19 18:51:36,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:51:36,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:51:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:36,988 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-19 18:51:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:37,081 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-19 18:51:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:37,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 18:51:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:37,082 INFO L225 Difference]: With dead ends: 61 [2019-11-19 18:51:37,082 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:51:37,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:51:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-19 18:51:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 18:51:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-19 18:51:37,087 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-11-19 18:51:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:37,087 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-19 18:51:37,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:51:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-19 18:51:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 18:51:37,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:37,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:37,091 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-11-19 18:51:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:37,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468873771] [2019-11-19 18:51:37,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468873771] [2019-11-19 18:51:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:37,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:51:37,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239788478] [2019-11-19 18:51:37,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:51:37,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:51:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:37,181 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-19 18:51:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:37,248 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-19 18:51:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:51:37,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 18:51:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:37,249 INFO L225 Difference]: With dead ends: 37 [2019-11-19 18:51:37,249 INFO L226 Difference]: Without dead ends: 33 [2019-11-19 18:51:37,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-19 18:51:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-19 18:51:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 18:51:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-19 18:51:37,255 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-19 18:51:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:37,255 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-19 18:51:37,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:51:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-19 18:51:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:51:37,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:37,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:37,259 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:37,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-11-19 18:51:37,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:37,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718179348] [2019-11-19 18:51:37,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:37,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718179348] [2019-11-19 18:51:37,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:37,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:51:37,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304447776] [2019-11-19 18:51:37,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:51:37,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:51:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:37,360 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-19 18:51:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:37,454 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-11-19 18:51:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:51:37,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-19 18:51:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:37,455 INFO L225 Difference]: With dead ends: 48 [2019-11-19 18:51:37,455 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 18:51:37,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:51:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 18:51:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-19 18:51:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 18:51:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-19 18:51:37,459 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-11-19 18:51:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:37,459 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-19 18:51:37,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:51:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-19 18:51:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 18:51:37,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:37,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:37,460 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-11-19 18:51:37,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:37,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400127192] [2019-11-19 18:51:37,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:37,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400127192] [2019-11-19 18:51:37,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:37,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:51:37,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656381489] [2019-11-19 18:51:37,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:51:37,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:51:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:51:37,506 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-19 18:51:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:37,602 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-19 18:51:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:51:37,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 18:51:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:37,605 INFO L225 Difference]: With dead ends: 52 [2019-11-19 18:51:37,605 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 18:51:37,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:51:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 18:51:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-11-19 18:51:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 18:51:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-19 18:51:37,609 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-11-19 18:51:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:37,610 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-19 18:51:37,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:51:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-19 18:51:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:51:37,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:51:37,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:51:37,611 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:51:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:51:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-11-19 18:51:37,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:51:37,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427805974] [2019-11-19 18:51:37,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:51:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:51:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:51:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427805974] [2019-11-19 18:51:37,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:51:37,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 18:51:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110285892] [2019-11-19 18:51:37,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 18:51:37,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:51:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 18:51:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 18:51:37,635 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-11-19 18:51:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:51:37,674 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-19 18:51:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 18:51:37,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-19 18:51:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:51:37,675 INFO L225 Difference]: With dead ends: 33 [2019-11-19 18:51:37,675 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:51:37,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 18:51:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:51:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:51:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:51:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:51:37,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-19 18:51:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:51:37,677 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:51:37,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 18:51:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:51:37,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:51:37,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-19 18:51:37,970 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-19 18:51:37,971 INFO L444 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-19 18:51:37,972 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L447 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L447 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-19 18:51:37,973 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-19 18:51:37,974 INFO L440 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-19 18:51:37,975 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-19 18:51:37,975 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-19 18:51:37,975 INFO L440 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-19 18:51:37,975 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-19 18:51:37,975 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-19 18:51:37,976 INFO L444 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-19 18:51:37,977 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-19 18:51:37,977 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-19 18:51:37,977 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 18:51:37,977 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-19 18:51:37,977 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-19 18:51:37,978 INFO L444 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-19 18:51:37,979 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-19 18:51:37,980 INFO L444 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-19 18:51:37,980 INFO L440 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-19 18:51:37,980 INFO L440 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-19 18:51:37,980 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-19 18:51:37,981 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-19 18:51:37,982 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-19 18:51:37,982 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-19 18:51:37,982 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-19 18:51:37,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:51:37 BoogieIcfgContainer [2019-11-19 18:51:38,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:51:38,000 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:51:38,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:51:38,000 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:51:38,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:34" (3/4) ... [2019-11-19 18:51:38,004 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:51:38,020 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 18:51:38,021 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 18:51:38,109 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:51:38,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:51:38,111 INFO L168 Benchmark]: Toolchain (without parser) took 4967.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 78.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:51:38,112 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:51:38,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:51:38,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:51:38,113 INFO L168 Benchmark]: Boogie Preprocessor took 25.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:51:38,114 INFO L168 Benchmark]: RCFGBuilder took 495.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:51:38,114 INFO L168 Benchmark]: TraceAbstraction took 3760.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:51:38,115 INFO L168 Benchmark]: Witness Printer took 109.26 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:51:38,117 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 495.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3760.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.4 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. * Witness Printer took 109.26 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 726 SDtfs, 1259 SDslu, 649 SDs, 0 SdLazy, 990 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 58 HoareAnnotationTreeSize, 6 FomulaSimplifications, 79390 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1100 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...