./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test23_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/ldv-regression/test23_false-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b974f281a213c0803f91ef44d205e442fb2a5f8f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 18:07:55,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:07:55,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:07:55,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:07:55,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:07:55,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:07:55,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:07:55,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:07:55,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:07:55,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:07:55,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:07:55,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:07:55,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:07:55,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:07:55,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:07:55,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:07:55,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:07:55,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:07:55,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:07:55,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:07:55,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:07:55,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:07:55,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:07:55,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:07:55,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:07:56,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:07:56,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:07:56,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:07:56,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:07:56,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:07:56,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:07:56,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:07:56,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:07:56,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:07:56,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:07:56,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:07:56,011 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:07:56,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:07:56,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:07:56,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:07:56,029 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:07:56,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:07:56,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:07:56,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:07:56,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:07:56,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:07:56,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:07:56,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:07:56,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:07:56,034 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:07:56,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:07:56,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:07:56,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:07:56,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:07:56,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:07:56,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:07:56,035 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:07:56,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:07:56,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:07:56,037 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:07:56,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:07:56,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:07:56,037 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 -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-11-28 18:07:56,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:07:56,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:07:56,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:07:56,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:07:56,095 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:07:56,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_false-unreach-call.c [2018-11-28 18:07:56,162 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e602089b/5cb4317485094e0da6bdbb2a2fa447e5/FLAG56419b4a5 [2018-11-28 18:07:56,650 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:07:56,651 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_false-unreach-call.c [2018-11-28 18:07:56,660 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e602089b/5cb4317485094e0da6bdbb2a2fa447e5/FLAG56419b4a5 [2018-11-28 18:07:57,002 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e602089b/5cb4317485094e0da6bdbb2a2fa447e5 [2018-11-28 18:07:57,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:07:57,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:07:57,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:07:57,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:07:57,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:07:57,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a867def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57, skipping insertion in model container [2018-11-28 18:07:57,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:07:57,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:07:57,247 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:07:57,265 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:07:57,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:07:57,311 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:07:57,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57 WrapperNode [2018-11-28 18:07:57,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:07:57,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:07:57,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:07:57,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:07:57,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:07:57,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:07:57,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:07:57,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:07:57,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (1/1) ... [2018-11-28 18:07:57,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:07:57,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:07:57,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:07:57,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:07:57,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (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 [2018-11-28 18:07:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:07:57,540 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-28 18:07:57,540 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-28 18:07:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:07:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:07:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:07:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-28 18:07:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-28 18:07:57,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:07:57,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:07:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:07:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:07:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:07:57,542 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 18:07:57,542 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 18:07:58,017 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:07:58,017 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 18:07:58,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:58 BoogieIcfgContainer [2018-11-28 18:07:58,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:07:58,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:07:58,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:07:58,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:07:58,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:57" (1/3) ... [2018-11-28 18:07:58,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f435863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:58, skipping insertion in model container [2018-11-28 18:07:58,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:57" (2/3) ... [2018-11-28 18:07:58,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f435863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:58, skipping insertion in model container [2018-11-28 18:07:58,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:58" (3/3) ... [2018-11-28 18:07:58,026 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-11-28 18:07:58,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:07:58,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:07:58,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:07:58,096 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:07:58,096 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:07:58,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:07:58,097 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:07:58,097 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:07:58,097 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:07:58,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:07:58,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:07:58,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:07:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 18:07:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:07:58,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:07:58,125 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:07:58,127 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:07:58,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:07:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-11-28 18:07:58,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:07:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:07:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:07:58,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:07:58,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:07:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:07:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:07:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:07:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:07:58,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:07:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:07:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:07:58,407 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-28 18:07:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:07:58,439 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 18:07:58,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:07:58,441 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-28 18:07:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:07:58,454 INFO L225 Difference]: With dead ends: 46 [2018-11-28 18:07:58,457 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:07:58,461 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 [2018-11-28 18:07:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:07:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:07:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:07:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 18:07:58,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-11-28 18:07:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:07:58,524 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 18:07:58,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:07:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 18:07:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:07:58,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:07:58,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:07:58,530 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:07:58,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:07:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-11-28 18:07:58,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:07:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:07:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:07:58,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:07:58,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:07:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:07:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:07:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:07:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 18:07:59,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:07:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:07:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:07:59,538 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-11-28 18:08:00,601 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 18:08:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:00,674 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-28 18:08:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:08:00,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-28 18:08:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:00,681 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:08:00,681 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 18:08:00,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:08:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 18:08:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-28 18:08:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:08:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-28 18:08:00,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-11-28 18:08:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:00,697 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-28 18:08:00,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:08:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-28 18:08:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:08:00,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:00,699 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:00,699 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:00,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-11-28 18:08:00,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:00,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:00,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:00,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:00,857 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 [2018-11-28 18:08:00,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:00,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:00,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 18:08:01,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 18:08:01,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:01,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:01,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:01,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 18:08:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:01,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:01,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-28 18:08:01,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:08:01,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:08:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:08:01,135 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-11-28 18:08:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:01,730 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-28 18:08:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:08:01,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 18:08:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:01,733 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:08:01,733 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 18:08:01,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:08:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 18:08:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-28 18:08:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:08:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 18:08:01,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-11-28 18:08:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:01,745 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 18:08:01,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:08:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 18:08:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:08:01,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:01,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:01,747 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:01,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-11-28 18:08:01,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:01,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:02,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 18:08:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:08:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:08:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:08:02,052 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 11 states. [2018-11-28 18:08:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:02,735 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-28 18:08:02,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:08:02,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-28 18:08:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:02,739 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:08:02,739 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 18:08:02,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:08:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 18:08:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-28 18:08:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 18:08:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 18:08:02,751 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-11-28 18:08:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 18:08:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:08:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 18:08:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 18:08:02,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:02,753 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:02,753 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-11-28 18:08:02,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:02,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:02,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:02,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:02,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:03,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:03,121 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 [2018-11-28 18:08:03,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:03,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:03,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 18:08:03,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 18:08:03,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:03,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:03,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:03,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-28 18:08:03,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-28 18:08:03,706 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:08:03,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 18:08:03,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:03,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:03,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:03,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-28 18:08:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:03,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-11-28 18:08:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 18:08:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 18:08:03,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:08:03,798 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2018-11-28 18:08:04,207 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 18:08:04,393 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-28 18:08:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:04,910 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-28 18:08:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:08:04,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-11-28 18:08:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:04,913 INFO L225 Difference]: With dead ends: 62 [2018-11-28 18:08:04,913 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 18:08:04,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 18:08:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 18:08:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-11-28 18:08:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 18:08:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 18:08:04,926 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-11-28 18:08:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:04,926 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 18:08:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 18:08:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 18:08:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 18:08:04,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:04,928 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:04,928 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:04,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 805044102, now seen corresponding path program 1 times [2018-11-28 18:08:04,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:05,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:05,374 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 [2018-11-28 18:08:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:05,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:05,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 18:08:05,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 18:08:05,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:05,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:06,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:06,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-28 18:08:06,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-28 18:08:06,140 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 18:08:06,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 18:08:06,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:06,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:06,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:06,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-28 18:08:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:06,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:06,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2018-11-28 18:08:06,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 18:08:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 18:08:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:08:06,201 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2018-11-28 18:08:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:07,165 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-28 18:08:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:08:07,173 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-28 18:08:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:07,174 INFO L225 Difference]: With dead ends: 66 [2018-11-28 18:08:07,174 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 18:08:07,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 18:08:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 18:08:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-11-28 18:08:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:08:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-28 18:08:07,194 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2018-11-28 18:08:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:07,196 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-28 18:08:07,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 18:08:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-28 18:08:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 18:08:07,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:07,204 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:07,204 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:07,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-11-28 18:08:07,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:07,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:07,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:07,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:07,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:07,774 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 [2018-11-28 18:08:07,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:08:07,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:08:07,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:07,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:08,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 18:08:08,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 18:08:08,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:08,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:08,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:08,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-11-28 18:08:08,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-28 18:08:08,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-28 18:08:08,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:08,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:08,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:08,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-28 18:08:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:08,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:08,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2018-11-28 18:08:08,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 18:08:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 18:08:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:08:08,304 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 24 states. [2018-11-28 18:08:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:09,578 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-28 18:08:09,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 18:08:09,578 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-11-28 18:08:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:09,579 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:08:09,580 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 18:08:09,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=464, Invalid=1792, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 18:08:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 18:08:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-11-28 18:08:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 18:08:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-28 18:08:09,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 37 [2018-11-28 18:08:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:09,596 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-28 18:08:09,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 18:08:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-28 18:08:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:08:09,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:09,598 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:09,598 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1199181769, now seen corresponding path program 2 times [2018-11-28 18:08:09,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:09,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:10,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:10,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:10,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:08:10,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:08:10,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:10,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:10,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 18:08:10,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 18:08:10,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:10,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:10,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:10,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-11-28 18:08:10,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-28 18:08:10,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-28 18:08:10,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:10,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:10,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:10,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-28 18:08:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:10,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:10,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2018-11-28 18:08:10,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 18:08:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 18:08:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-11-28 18:08:10,755 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2018-11-28 18:08:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:13,879 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-11-28 18:08:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-28 18:08:13,880 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-11-28 18:08:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:13,881 INFO L225 Difference]: With dead ends: 117 [2018-11-28 18:08:13,882 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 18:08:13,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1351, Invalid=4501, Unknown=0, NotChecked=0, Total=5852 [2018-11-28 18:08:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 18:08:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2018-11-28 18:08:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 18:08:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-28 18:08:13,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2018-11-28 18:08:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:13,905 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-28 18:08:13,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 18:08:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-28 18:08:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 18:08:13,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:13,907 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:13,907 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:13,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:13,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-11-28 18:08:13,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:13,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:13,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:08:14,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:14,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:08:14,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-28 18:08:14,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:14,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:14,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 18:08:14,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 18:08:14,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:14,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:14,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:14,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-11-28 18:08:14,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-28 18:08:14,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-28 18:08:14,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:14,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:14,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:14,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-11-28 18:08:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:15,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:15,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2018-11-28 18:08:15,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 18:08:15,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 18:08:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-11-28 18:08:15,047 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 32 states. [2018-11-28 18:08:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:17,607 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-11-28 18:08:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 18:08:17,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-11-28 18:08:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:17,609 INFO L225 Difference]: With dead ends: 118 [2018-11-28 18:08:17,610 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 18:08:17,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1141, Invalid=4261, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 18:08:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 18:08:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 55. [2018-11-28 18:08:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 18:08:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-28 18:08:17,636 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2018-11-28 18:08:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:17,636 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-28 18:08:17,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 18:08:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-28 18:08:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 18:08:17,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:17,641 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:17,641 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:17,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 821150421, now seen corresponding path program 4 times [2018-11-28 18:08:17,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:17,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:17,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:17,778 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:08:17,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:17 BoogieIcfgContainer [2018-11-28 18:08:17,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:08:17,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:08:17,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:08:17,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:08:17,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:58" (3/4) ... [2018-11-28 18:08:17,870 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:08:17,949 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:08:17,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:08:17,951 INFO L168 Benchmark]: Toolchain (without parser) took 20944.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -297.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:17,952 INFO L168 Benchmark]: CDTParser took 0.20 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. [2018-11-28 18:08:17,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:17,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.95 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:17,953 INFO L168 Benchmark]: Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:17,955 INFO L168 Benchmark]: RCFGBuilder took 635.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:17,956 INFO L168 Benchmark]: TraceAbstraction took 19846.86 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:17,957 INFO L168 Benchmark]: Witness Printer took 83.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:17,962 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.20 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 303.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 23.95 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 635.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19846.86 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] struct dummy d1, d2; VAL [\old(d1)=79, \old(d1)=74, \old(d2)=75, \old(d2)=77, d1={1:0}, d2={78:0}] [L33] CALL init() VAL [d1={1:0}, d2={78:0}] [L14] d1.a = __VERIFIER_nondet_int() [L15] d1.b = __VERIFIER_nondet_int() [L17] d2.a = __VERIFIER_nondet_int() [L18] d2.b = __VERIFIER_nondet_int() [L33] RET init() VAL [d1={1:0}, d2={78:0}] [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={78:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={1:0}, d2={78:0}, get_dummy()={1:0}, pd1={1:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=-1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=0, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=1, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=2, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=3, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=4, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=5, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=6, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={1:0}, d2={78:0}, s1={1:0}] [L28] EXPR s1->array[i] [L28] return s1->array[i] == i; [L43] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={1:0}, d2={78:0}, i=7, pa={1:32}, pd1={1:0}, pd2={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. UNSAFE Result, 19.7s OverallTime, 10 OverallIterations, 12 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 491 SDslu, 2435 SDs, 0 SdLazy, 2040 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 176 SyntacticMatches, 25 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4045 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 179 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 521 ConstructedInterpolants, 41 QuantifiedInterpolants, 128959 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1031 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 47/272 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...