./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.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 77cd31699320cd40da64f32a92959020d19291bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 77cd31699320cd40da64f32a92959020d19291bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-0ed9222-m [2019-01-12 10:48:23,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:48:23,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:48:23,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:48:23,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:48:23,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:48:23,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:48:23,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:48:23,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:48:23,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:48:23,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:48:23,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:48:23,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:48:23,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:48:23,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:48:23,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:48:23,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:48:23,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:48:23,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:48:23,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:48:23,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:48:23,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:48:23,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:48:23,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:48:23,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:48:23,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:48:23,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:48:23,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:48:23,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:48:23,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:48:23,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:48:23,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:48:23,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:48:23,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:48:23,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:48:23,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:48:23,476 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:48:23,494 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:48:23,494 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:48:23,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:48:23,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:48:23,496 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:48:23,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:48:23,496 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:48:23,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:48:23,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:48:23,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:48:23,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:48:23,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:48:23,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:48:23,498 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:48:23,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:48:23,499 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:48:23,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:48:23,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:48:23,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:48:23,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:48:23,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:48:23,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:48:23,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:48:23,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:48:23,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:48:23,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:48:23,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:48:23,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:48:23,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2019-01-12 10:48:23,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:48:23,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:48:23,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:48:23,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:48:23,578 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:48:23,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-12 10:48:23,642 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3e2516/c0d5474ac96c4ffab8cd5007f463c83a/FLAG2df44b14a [2019-01-12 10:48:24,088 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:48:24,089 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-12 10:48:24,096 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3e2516/c0d5474ac96c4ffab8cd5007f463c83a/FLAG2df44b14a [2019-01-12 10:48:24,446 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3e2516/c0d5474ac96c4ffab8cd5007f463c83a [2019-01-12 10:48:24,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:48:24,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:48:24,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:24,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:48:24,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:48:24,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d57bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24, skipping insertion in model container [2019-01-12 10:48:24,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:48:24,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:48:24,778 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:24,784 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:48:24,821 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:24,848 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:48:24,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24 WrapperNode [2019-01-12 10:48:24,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:24,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:24,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:48:24,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:48:24,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:24,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:48:24,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:48:24,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:48:24,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (1/1) ... [2019-01-12 10:48:24,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:48:24,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:48:24,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:48:24,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:48:25,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (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-01-12 10:48:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 10:48:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:48:25,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:48:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 10:48:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:48:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:48:25,527 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:48:25,528 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-12 10:48:25,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:25 BoogieIcfgContainer [2019-01-12 10:48:25,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:48:25,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:48:25,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:48:25,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:48:25,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:48:24" (1/3) ... [2019-01-12 10:48:25,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c82f548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:25, skipping insertion in model container [2019-01-12 10:48:25,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:24" (2/3) ... [2019-01-12 10:48:25,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c82f548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:25, skipping insertion in model container [2019-01-12 10:48:25,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:25" (3/3) ... [2019-01-12 10:48:25,538 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2019-01-12 10:48:25,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:48:25,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:48:25,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:48:25,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:48:25,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:48:25,606 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:48:25,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:48:25,607 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:48:25,607 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:48:25,607 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:48:25,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:48:25,608 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:48:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-01-12 10:48:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 10:48:25,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:25,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:25,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-01-12 10:48:25,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:25,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:25,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:48:25,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:48:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:48:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:48:25,806 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-01-12 10:48:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:25,825 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-01-12 10:48:25,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:48:25,827 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 10:48:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:25,836 INFO L225 Difference]: With dead ends: 48 [2019-01-12 10:48:25,836 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 10:48:25,839 INFO L631 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-01-12 10:48:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 10:48:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 10:48:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:48:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-12 10:48:25,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-01-12 10:48:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:25,874 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-12 10:48:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:48:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-01-12 10:48:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:48:25,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:25,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:25,876 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-01-12 10:48:25,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:25,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 10:48:25,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 10:48:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 10:48:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:48:25,926 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-01-12 10:48:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:26,048 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-01-12 10:48:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 10:48:26,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 10:48:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:26,051 INFO L225 Difference]: With dead ends: 50 [2019-01-12 10:48:26,051 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 10:48:26,052 INFO L631 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-01-12 10:48:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 10:48:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-12 10:48:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 10:48:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-01-12 10:48:26,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-01-12 10:48:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:26,058 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-12 10:48:26,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 10:48:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-01-12 10:48:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 10:48:26,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:26,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:26,060 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2019-01-12 10:48:26,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:26,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:26,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:26,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:26,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:48:26,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:26,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:26,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:48:26,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:26,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 10:48:26,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:48:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:48:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:48:26,363 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 5 states. [2019-01-12 10:48:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:26,608 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-01-12 10:48:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:48:26,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 10:48:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:26,610 INFO L225 Difference]: With dead ends: 61 [2019-01-12 10:48:26,610 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 10:48:26,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:48:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 10:48:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-01-12 10:48:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 10:48:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-12 10:48:26,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-01-12 10:48:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:26,619 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-12 10:48:26,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:48:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-12 10:48:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 10:48:26,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:26,621 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:26,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1590720246, now seen corresponding path program 2 times [2019-01-12 10:48:26,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 10:48:26,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:26,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:26,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:26,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:48:26,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:26,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 10:48:26,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:26,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 10:48:26,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:48:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:48:26,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:48:26,840 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-01-12 10:48:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:27,106 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2019-01-12 10:48:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:48:27,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-12 10:48:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:27,107 INFO L225 Difference]: With dead ends: 73 [2019-01-12 10:48:27,107 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 10:48:27,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:48:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 10:48:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2019-01-12 10:48:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 10:48:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-12 10:48:27,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2019-01-12 10:48:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:27,118 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-12 10:48:27,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:48:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-01-12 10:48:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 10:48:27,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:27,119 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:27,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash -381068522, now seen corresponding path program 3 times [2019-01-12 10:48:27,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:27,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:27,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 10:48:27,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:27,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:27,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 10:48:27,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 10:48:27,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:27,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 10:48:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:27,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-12 10:48:27,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:48:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:48:27,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:48:27,361 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-01-12 10:48:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:27,825 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-01-12 10:48:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:48:27,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-01-12 10:48:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:27,827 INFO L225 Difference]: With dead ends: 85 [2019-01-12 10:48:27,827 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 10:48:27,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:48:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 10:48:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2019-01-12 10:48:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 10:48:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-12 10:48:27,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2019-01-12 10:48:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:27,834 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-12 10:48:27,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:48:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-12 10:48:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 10:48:27,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:27,836 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:27,836 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 4 times [2019-01-12 10:48:27,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:27,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:27,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 10:48:27,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:48:27,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:48:27,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 10:48:27,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 10:48:27,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:27,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 10:48:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 10:48:28,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 10:48:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 10:48:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:48:28,036 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-01-12 10:48:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:28,450 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-01-12 10:48:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:48:28,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-12 10:48:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:28,453 INFO L225 Difference]: With dead ends: 95 [2019-01-12 10:48:28,453 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 10:48:28,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:48:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 10:48:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-12 10:48:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 10:48:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-12 10:48:28,471 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2019-01-12 10:48:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:28,478 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-12 10:48:28,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 10:48:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-12 10:48:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 10:48:28,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:28,480 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:28,480 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 5 times [2019-01-12 10:48:28,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:48:28,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:48:28,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:28,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:48:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:28,679 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:48:28,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:48:28 BoogieIcfgContainer [2019-01-12 10:48:28,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:48:28,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:48:28,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:48:28,721 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:48:28,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:25" (3/4) ... [2019-01-12 10:48:28,726 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 10:48:28,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:48:28,727 INFO L168 Benchmark]: Toolchain (without parser) took 4276.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.3 MB in the beginning and 947.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,729 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:28,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,731 INFO L168 Benchmark]: Boogie Preprocessor took 97.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,732 INFO L168 Benchmark]: RCFGBuilder took 530.94 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,733 INFO L168 Benchmark]: TraceAbstraction took 3189.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.8 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:28,734 INFO L168 Benchmark]: Witness Printer took 5.55 ms. Allocated memory is still 1.2 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:28,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 530.94 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3189.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 947.8 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.55 ms. Allocated memory is still 1.2 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 55. Possible FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND FALSE !((inc_B-1)< 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 -> 77cd31699320cd40da64f32a92959020d19291bd [2019-01-12 10:48:31,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:48:31,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:48:31,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:48:31,261 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:48:31,262 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:48:31,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-12 10:48:31,324 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33136a94b/8b3145c8712a471593aac6a1b7d53d61/FLAGc884cac96 [2019-01-12 10:48:31,705 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:48:31,706 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-12 10:48:31,713 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33136a94b/8b3145c8712a471593aac6a1b7d53d61/FLAGc884cac96 [2019-01-12 10:48:32,115 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33136a94b/8b3145c8712a471593aac6a1b7d53d61 [2019-01-12 10:48:32,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:48:32,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:48:32,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:32,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:48:32,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:48:32,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32, skipping insertion in model container [2019-01-12 10:48:32,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:48:32,158 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:48:32,414 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:32,422 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:48:32,463 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:48:32,495 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:48:32,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32 WrapperNode [2019-01-12 10:48:32,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:48:32,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:32,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:48:32,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:48:32,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:48:32,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:48:32,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:48:32,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:48:32,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (1/1) ... [2019-01-12 10:48:32,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:48:32,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:48:32,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:48:32,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:48:32,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (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-01-12 10:48:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-01-12 10:48:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:48:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:48:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-01-12 10:48:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:48:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:48:33,172 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:48:33,172 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-12 10:48:33,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:33 BoogieIcfgContainer [2019-01-12 10:48:33,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:48:33,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:48:33,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:48:33,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:48:33,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:48:32" (1/3) ... [2019-01-12 10:48:33,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260f7709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:33, skipping insertion in model container [2019-01-12 10:48:33,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:48:32" (2/3) ... [2019-01-12 10:48:33,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260f7709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:48:33, skipping insertion in model container [2019-01-12 10:48:33,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:33" (3/3) ... [2019-01-12 10:48:33,190 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2019-01-12 10:48:33,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:48:33,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:48:33,223 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:48:33,252 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:48:33,253 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:48:33,253 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:48:33,253 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:48:33,253 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:48:33,253 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:48:33,254 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:48:33,254 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:48:33,254 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:48:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-01-12 10:48:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 10:48:33,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:33,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:33,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2019-01-12 10:48:33,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:33,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:33,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:33,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:33,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:48:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:48:33,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:48:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:48:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:48:33,393 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-01-12 10:48:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:33,408 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2019-01-12 10:48:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:48:33,409 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 10:48:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:33,418 INFO L225 Difference]: With dead ends: 48 [2019-01-12 10:48:33,418 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 10:48:33,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-01-12 10:48:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 10:48:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 10:48:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:48:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-12 10:48:33,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2019-01-12 10:48:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:33,453 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-12 10:48:33,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:48:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-01-12 10:48:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 10:48:33,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:33,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:33,454 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2019-01-12 10:48:33,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:33,457 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:33,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:33,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:48:33,565 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:48:33,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 10:48:33,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 10:48:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 10:48:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:48:33,575 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2019-01-12 10:48:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:33,819 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-01-12 10:48:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 10:48:33,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 10:48:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:33,824 INFO L225 Difference]: With dead ends: 50 [2019-01-12 10:48:33,824 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 10:48:33,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-01-12 10:48:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 10:48:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-12 10:48:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 10:48:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-01-12 10:48:33,834 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2019-01-12 10:48:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:33,834 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-12 10:48:33,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 10:48:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-01-12 10:48:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 10:48:33,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:33,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:33,836 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2019-01-12 10:48:33,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:33,839 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:48:33,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:48:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:48:34,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-12 10:48:34,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:48:34,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:48:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:48:34,127 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2019-01-12 10:48:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:34,582 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-01-12 10:48:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:48:34,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 10:48:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:34,586 INFO L225 Difference]: With dead ends: 79 [2019-01-12 10:48:34,586 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 10:48:34,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:48:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 10:48:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-12 10:48:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 10:48:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-12 10:48:34,595 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2019-01-12 10:48:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:34,596 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-12 10:48:34,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:48:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-12 10:48:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 10:48:34,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:34,599 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:34,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2019-01-12 10:48:34,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:34,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:34,628 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:34,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-12 10:48:34,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:34,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 10:48:34,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:48:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 10:48:34,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:48:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:48:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:48:34,784 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-01-12 10:48:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:34,940 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-01-12 10:48:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:48:34,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 10:48:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:34,943 INFO L225 Difference]: With dead ends: 48 [2019-01-12 10:48:34,943 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 10:48:34,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-01-12 10:48:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 10:48:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 10:48:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 10:48:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-12 10:48:34,952 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2019-01-12 10:48:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:34,953 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-12 10:48:34,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:48:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-01-12 10:48:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 10:48:34,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:34,955 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:34,955 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2019-01-12 10:48:34,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:34,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:34,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:35,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 10:48:35,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 10:48:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 10:48:35,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:48:35,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-12 10:48:35,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 10:48:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 10:48:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:48:35,545 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 12 states. [2019-01-12 10:48:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:36,502 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2019-01-12 10:48:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 10:48:36,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-01-12 10:48:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:36,509 INFO L225 Difference]: With dead ends: 101 [2019-01-12 10:48:36,509 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 10:48:36,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 10:48:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 10:48:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2019-01-12 10:48:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 10:48:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-12 10:48:36,533 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2019-01-12 10:48:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:36,533 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-12 10:48:36,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 10:48:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-12 10:48:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 10:48:36,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:36,535 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:36,535 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2019-01-12 10:48:36,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:36,580 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 10:48:36,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-12 10:48:36,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:48:36,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-12 10:48:36,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:48:36,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:36,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:48:36,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:48:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:48:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:48:36,846 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 4 states. [2019-01-12 10:48:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:36,980 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-12 10:48:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:48:36,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-01-12 10:48:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:36,982 INFO L225 Difference]: With dead ends: 48 [2019-01-12 10:48:36,982 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 10:48:36,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:48:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 10:48:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-01-12 10:48:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 10:48:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-12 10:48:37,001 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-01-12 10:48:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:37,004 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-12 10:48:37,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:48:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-12 10:48:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 10:48:37,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:37,005 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:37,006 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2019-01-12 10:48:37,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:37,010 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:37,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 10:48:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:48:37,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:48:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-12 10:48:37,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 10:48:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:48:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:48:37,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:48:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:48:37,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:48:37,222 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-12 10:48:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:48:37,314 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-01-12 10:48:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:48:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-01-12 10:48:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:48:37,317 INFO L225 Difference]: With dead ends: 58 [2019-01-12 10:48:37,318 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 10:48:37,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:48:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 10:48:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 10:48:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 10:48:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-12 10:48:37,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2019-01-12 10:48:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:48:37,326 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-12 10:48:37,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:48:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-12 10:48:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 10:48:37,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:48:37,328 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:48:37,328 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:48:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:48:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2019-01-12 10:48:37,329 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 10:48:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 10:48:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:48:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 10:48:38,188 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 10:48:38,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:48:38 BoogieIcfgContainer [2019-01-12 10:48:38,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:48:38,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:48:38,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:48:38,241 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:48:38,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:48:33" (3/4) ... [2019-01-12 10:48:38,247 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 10:48:38,365 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:48:38,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:48:38,369 INFO L168 Benchmark]: Toolchain (without parser) took 6249.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.3 MB in the beginning and 886.4 MB in the end (delta: 64.9 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,373 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:48:38,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.14 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.64 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,380 INFO L168 Benchmark]: Boogie Preprocessor took 99.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,381 INFO L168 Benchmark]: RCFGBuilder took 529.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,382 INFO L168 Benchmark]: TraceAbstraction took 5062.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.0 MB in the end (delta: 216.2 MB). Peak memory consumption was 216.2 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,386 INFO L168 Benchmark]: Witness Printer took 126.96 ms. Allocated memory is still 1.2 GB. Free memory was 893.0 MB in the beginning and 886.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 10:48:38,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.14 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.64 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 529.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5062.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.0 MB in the end (delta: 216.2 MB). Peak memory consumption was 216.2 MB. Max. memory is 11.5 GB. * Witness Printer took 126.96 ms. Allocated memory is still 1.2 GB. Free memory was 893.0 MB in the beginning and 886.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i<5) [L23] EXPR string_A[5 -1] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ [L25] COND FALSE !(i<5) [L27] EXPR string_B[5 -1] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 [L30] EXPR string_A[nc_A] [L30] COND TRUE string_A[nc_A]!='\0' [L31] nc_A++ [L30] EXPR string_A[nc_A] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 [L34] EXPR string_B[nc_B] [L34] COND TRUE string_B[nc_B]!='\0' [L35] nc_B++ [L34] EXPR string_B[nc_B] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 [L41] COND TRUE (inc_B-1)<