./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -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 5f5357e64289d6bac41f74df7b40a85eebbaa806 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:04:12,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:04:12,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:04:12,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:04:12,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:04:12,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:04:12,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:04:12,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:04:12,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:04:12,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:04:12,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:04:12,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:04:12,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:04:12,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:04:12,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:04:12,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:04:12,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:04:12,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:04:12,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:04:12,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:04:12,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:04:12,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:04:12,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:04:12,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:04:12,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:04:12,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:04:12,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:04:12,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:04:12,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:04:12,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:04:12,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:04:12,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:04:12,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:04:12,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:04:12,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:04:12,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:04:12,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:04:12,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:04:12,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:04:12,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:04:12,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:04:12,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:04:12,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:04:12,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:04:12,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:04:12,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:04:12,250 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:04:12,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:04:12,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:04:12,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:04:12,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:04:12,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:04:12,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:04:12,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:04:12,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:04:12,253 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:04:12,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:04:12,253 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:04:12,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:04:12,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:04:12,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:04:12,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:04:12,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:04:12,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:04:12,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:04:12,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:04:12,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:04:12,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:04:12,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:04:12,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:04:12,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:04:12,258 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 -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-11-28 17:04:12,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:04:12,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:04:12,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:04:12,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:04:12,573 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:04:12,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 17:04:12,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7a818dc/e474ffe945fc4baaa0c70d4f7b2e4eb6/FLAGe8e53ef48 [2019-11-28 17:04:13,169 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:04:13,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 17:04:13,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7a818dc/e474ffe945fc4baaa0c70d4f7b2e4eb6/FLAGe8e53ef48 [2019-11-28 17:04:13,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7a818dc/e474ffe945fc4baaa0c70d4f7b2e4eb6 [2019-11-28 17:04:13,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:04:13,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:04:13,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:04:13,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:04:13,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:04:13,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc9a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13, skipping insertion in model container [2019-11-28 17:04:13,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:04:13,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:04:13,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:04:13,802 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:04:13,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:04:13,931 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:04:13,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13 WrapperNode [2019-11-28 17:04:13,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:04:13,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:04:13,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:04:13,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:04:13,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:04:13,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:04:13,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:04:13,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:04:13,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:13,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:14,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:14,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:14,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... [2019-11-28 17:04:14,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:04:14,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:04:14,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:04:14,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:04:14,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:04:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:04:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:04:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:04:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-28 17:04:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:04:14,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:04:14,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:04:14,488 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:04:14,488 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 17:04:14,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:04:14 BoogieIcfgContainer [2019-11-28 17:04:14,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:04:14,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:04:14,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:04:14,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:04:14,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:04:13" (1/3) ... [2019-11-28 17:04:14,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf587e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:04:14, skipping insertion in model container [2019-11-28 17:04:14,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:04:13" (2/3) ... [2019-11-28 17:04:14,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf587e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:04:14, skipping insertion in model container [2019-11-28 17:04:14,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:04:14" (3/3) ... [2019-11-28 17:04:14,498 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-28 17:04:14,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:04:14,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:04:14,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:04:14,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:04:14,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:04:14,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:04:14,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:04:14,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:04:14,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:04:14,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:04:14,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:04:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-28 17:04:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:04:14,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:14,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:14,571 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -649032135, now seen corresponding path program 1 times [2019-11-28 17:04:14,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:14,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018895226] [2019-11-28 17:04:14,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:14,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018895226] [2019-11-28 17:04:14,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:14,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:04:14,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412581578] [2019-11-28 17:04:14,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:04:14,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:04:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:04:14,746 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-11-28 17:04:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:14,775 INFO L93 Difference]: Finished difference Result 65 states and 94 transitions. [2019-11-28 17:04:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:04:14,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-28 17:04:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:14,788 INFO L225 Difference]: With dead ends: 65 [2019-11-28 17:04:14,788 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:04:14,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:04:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:04:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 17:04:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:04:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-11-28 17:04:14,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 17 [2019-11-28 17:04:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:14,841 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-28 17:04:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:04:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-11-28 17:04:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:04:14,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:14,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:14,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -829015504, now seen corresponding path program 1 times [2019-11-28 17:04:14,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:14,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554378311] [2019-11-28 17:04:14,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:14,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554378311] [2019-11-28 17:04:14,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:14,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:04:14,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598996264] [2019-11-28 17:04:14,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:04:14,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:14,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:04:14,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:04:14,961 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 3 states. [2019-11-28 17:04:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:15,000 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-11-28 17:04:15,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:04:15,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 17:04:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:15,002 INFO L225 Difference]: With dead ends: 56 [2019-11-28 17:04:15,002 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 17:04:15,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:04:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 17:04:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 17:04:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:04:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-28 17:04:15,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2019-11-28 17:04:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-28 17:04:15,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:04:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-11-28 17:04:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:04:15,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:15,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:15,012 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2108879182, now seen corresponding path program 1 times [2019-11-28 17:04:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:15,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485777390] [2019-11-28 17:04:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:15,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485777390] [2019-11-28 17:04:15,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:15,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:04:15,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240525911] [2019-11-28 17:04:15,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:04:15,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:04:15,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:04:15,124 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 5 states. [2019-11-28 17:04:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:15,252 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2019-11-28 17:04:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:04:15,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 17:04:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:15,254 INFO L225 Difference]: With dead ends: 85 [2019-11-28 17:04:15,254 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 17:04:15,255 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-28 17:04:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 17:04:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2019-11-28 17:04:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:04:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-28 17:04:15,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 21 [2019-11-28 17:04:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:15,263 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 17:04:15,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:04:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2019-11-28 17:04:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:04:15,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:15,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:15,265 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2049773838, now seen corresponding path program 1 times [2019-11-28 17:04:15,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:15,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919884102] [2019-11-28 17:04:15,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:15,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919884102] [2019-11-28 17:04:15,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:15,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:04:15,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414253078] [2019-11-28 17:04:15,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:04:15,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:04:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:04:15,396 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 7 states. [2019-11-28 17:04:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:15,741 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2019-11-28 17:04:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:04:15,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 17:04:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:15,744 INFO L225 Difference]: With dead ends: 167 [2019-11-28 17:04:15,744 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 17:04:15,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:04:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 17:04:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 45. [2019-11-28 17:04:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 17:04:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2019-11-28 17:04:15,767 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2019-11-28 17:04:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:15,767 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-11-28 17:04:15,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:04:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2019-11-28 17:04:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:04:15,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:15,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:15,772 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1791608400, now seen corresponding path program 1 times [2019-11-28 17:04:15,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:15,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252514309] [2019-11-28 17:04:15,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:15,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252514309] [2019-11-28 17:04:15,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:15,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:04:15,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039500189] [2019-11-28 17:04:15,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:04:15,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:04:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:04:15,870 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand 6 states. [2019-11-28 17:04:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:16,068 INFO L93 Difference]: Finished difference Result 139 states and 187 transitions. [2019-11-28 17:04:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:04:16,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 17:04:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:16,074 INFO L225 Difference]: With dead ends: 139 [2019-11-28 17:04:16,074 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 17:04:16,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:04:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 17:04:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 40. [2019-11-28 17:04:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:04:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-11-28 17:04:16,096 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 21 [2019-11-28 17:04:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:16,097 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-11-28 17:04:16,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:04:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2019-11-28 17:04:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:04:16,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:16,101 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:16,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1282522692, now seen corresponding path program 1 times [2019-11-28 17:04:16,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:16,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235486900] [2019-11-28 17:04:16,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:04:16,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235486900] [2019-11-28 17:04:16,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:16,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 17:04:16,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88767586] [2019-11-28 17:04:16,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:04:16,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:16,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:04:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:04:16,264 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 8 states. [2019-11-28 17:04:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:16,581 INFO L93 Difference]: Finished difference Result 142 states and 189 transitions. [2019-11-28 17:04:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:04:16,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-28 17:04:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:16,583 INFO L225 Difference]: With dead ends: 142 [2019-11-28 17:04:16,583 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 17:04:16,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:04:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 17:04:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2019-11-28 17:04:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:04:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2019-11-28 17:04:16,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 26 [2019-11-28 17:04:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:16,594 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2019-11-28 17:04:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:04:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2019-11-28 17:04:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:04:16,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:16,595 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:16,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1024357254, now seen corresponding path program 1 times [2019-11-28 17:04:16,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:16,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415770704] [2019-11-28 17:04:16,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:04:16,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415770704] [2019-11-28 17:04:16,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:16,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:04:16,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596022233] [2019-11-28 17:04:16,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:04:16,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:16,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:04:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:04:16,666 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand 6 states. [2019-11-28 17:04:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:16,791 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2019-11-28 17:04:16,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:04:16,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 17:04:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:16,793 INFO L225 Difference]: With dead ends: 101 [2019-11-28 17:04:16,793 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 17:04:16,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:04:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 17:04:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2019-11-28 17:04:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 17:04:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2019-11-28 17:04:16,804 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 26 [2019-11-28 17:04:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:16,804 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2019-11-28 17:04:16,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:04:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2019-11-28 17:04:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:04:16,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:16,806 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:16,806 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:16,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2103980087, now seen corresponding path program 1 times [2019-11-28 17:04:16,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:16,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112578634] [2019-11-28 17:04:16,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:04:16,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112578634] [2019-11-28 17:04:16,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:04:16,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:04:16,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682139422] [2019-11-28 17:04:16,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:04:16,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:04:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:04:16,859 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 4 states. [2019-11-28 17:04:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:16,890 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2019-11-28 17:04:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:04:16,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 17:04:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:16,892 INFO L225 Difference]: With dead ends: 130 [2019-11-28 17:04:16,892 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:04:16,893 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-28 17:04:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:04:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 17:04:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:04:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2019-11-28 17:04:16,901 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 28 [2019-11-28 17:04:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:16,902 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2019-11-28 17:04:16,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:04:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2019-11-28 17:04:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:04:16,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:16,904 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:16,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1710953077, now seen corresponding path program 1 times [2019-11-28 17:04:16,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:16,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571761125] [2019-11-28 17:04:16,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:16,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571761125] [2019-11-28 17:04:16,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548577036] [2019-11-28 17:04:16,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:17,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:04:17,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:04:17,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:04:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:17,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:04:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 17:04:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415225664] [2019-11-28 17:04:17,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:04:17,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:04:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:04:17,105 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 8 states. [2019-11-28 17:04:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:17,231 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2019-11-28 17:04:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:04:17,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-28 17:04:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:17,233 INFO L225 Difference]: With dead ends: 194 [2019-11-28 17:04:17,233 INFO L226 Difference]: Without dead ends: 119 [2019-11-28 17:04:17,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:04:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-28 17:04:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2019-11-28 17:04:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 17:04:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-11-28 17:04:17,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 28 [2019-11-28 17:04:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-11-28 17:04:17,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:04:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-11-28 17:04:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:04:17,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:17,244 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:17,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:17,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2012014699, now seen corresponding path program 2 times [2019-11-28 17:04:17,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:17,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925451040] [2019-11-28 17:04:17,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:17,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925451040] [2019-11-28 17:04:17,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706186415] [2019-11-28 17:04:17,622 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:17,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:04:17,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:04:17,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 17:04:17,703 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:04:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:17,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:04:17,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-28 17:04:17,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770756872] [2019-11-28 17:04:17,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:04:17,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:04:17,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:04:17,871 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 17 states. [2019-11-28 17:04:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:18,413 INFO L93 Difference]: Finished difference Result 218 states and 272 transitions. [2019-11-28 17:04:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:04:18,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-11-28 17:04:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:18,415 INFO L225 Difference]: With dead ends: 218 [2019-11-28 17:04:18,415 INFO L226 Difference]: Without dead ends: 171 [2019-11-28 17:04:18,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:04:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-28 17:04:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 114. [2019-11-28 17:04:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 17:04:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-11-28 17:04:18,425 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 33 [2019-11-28 17:04:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:18,426 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-11-28 17:04:18,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:04:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-11-28 17:04:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:04:18,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:18,428 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:18,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:18,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1000897449, now seen corresponding path program 1 times [2019-11-28 17:04:18,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:18,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274447205] [2019-11-28 17:04:18,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:18,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274447205] [2019-11-28 17:04:18,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894148831] [2019-11-28 17:04:18,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:04:18,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 17:04:18,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:04:18,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:04:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:04:18,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:04:18,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 17:04:18,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476528361] [2019-11-28 17:04:18,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:04:18,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:04:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:04:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:04:18,908 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 16 states. [2019-11-28 17:04:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:04:19,445 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2019-11-28 17:04:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:04:19,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-28 17:04:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:04:19,447 INFO L225 Difference]: With dead ends: 220 [2019-11-28 17:04:19,447 INFO L226 Difference]: Without dead ends: 218 [2019-11-28 17:04:19,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:04:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-28 17:04:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 133. [2019-11-28 17:04:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 17:04:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2019-11-28 17:04:19,457 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 33 [2019-11-28 17:04:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:04:19,458 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2019-11-28 17:04:19,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:04:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2019-11-28 17:04:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:04:19,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:04:19,459 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:04:19,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:04:19,672 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:04:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:04:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1002744491, now seen corresponding path program 1 times [2019-11-28 17:04:19,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:04:19,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766940738] [2019-11-28 17:04:19,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:04:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:04:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:04:19,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:04:19,728 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:04:19,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:04:19 BoogieIcfgContainer [2019-11-28 17:04:19,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:04:19,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:04:19,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:04:19,797 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:04:19,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:04:14" (3/4) ... [2019-11-28 17:04:19,811 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:04:19,885 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:04:19,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:04:19,887 INFO L168 Benchmark]: Toolchain (without parser) took 6354.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 963.1 MB in the beginning and 976.6 MB in the end (delta: -13.5 MB). Peak memory consumption was 201.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:04:19,888 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:04:19,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:04:19,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:04:19,890 INFO L168 Benchmark]: Boogie Preprocessor took 33.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:04:19,890 INFO L168 Benchmark]: RCFGBuilder took 475.50 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:04:19,891 INFO L168 Benchmark]: TraceAbstraction took 5306.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 128.0 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:04:19,892 INFO L168 Benchmark]: Witness Printer took 88.01 ms. Allocated memory is still 1.2 GB. Free memory was 984.0 MB in the beginning and 976.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:04:19,895 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.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 963.1 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 475.50 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5306.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 128.0 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. * Witness Printer took 88.01 ms. Allocated memory is still 1.2 GB. Free memory was 984.0 MB in the beginning and 976.6 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; [L50] COND FALSE !(!str) [L52] i++ [L53] str[i] [L54] case 0: [L69] EXPR str[i] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: [L69] EXPR str[i] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j [L30] return strncpy(dest,src,n); [L3] COND TRUE !(cond) [L4] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 554 SDtfs, 1178 SDslu, 1594 SDs, 0 SdLazy, 1436 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=11, 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, 11 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 41269 SizeOfPredicates, 10 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 6/46 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 incorrect! Received shutdown request...