./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer --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 f18f7f1f917468e24f0e5d26966f1156107884dd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-15 20:13:04,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:13:04,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:13:05,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:13:05,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:13:05,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:13:05,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:13:05,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:13:05,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:13:05,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:13:05,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:13:05,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:13:05,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:13:05,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:13:05,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:13:05,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:13:05,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:13:05,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:13:05,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:13:05,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:13:05,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:13:05,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:13:05,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:13:05,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:13:05,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:13:05,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:13:05,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:13:05,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:13:05,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:13:05,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:13:05,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:13:05,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:13:05,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:13:05,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:13:05,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:13:05,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:13:05,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:13:05,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:13:05,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:13:05,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:13:05,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:13:05,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:13:05,056 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:13:05,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:13:05,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:13:05,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:13:05,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:13:05,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:13:05,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:13:05,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:13:05,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:13:05,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:13:05,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:13:05,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:13:05,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:13:05,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:13:05,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:13:05,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:13:05,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:13:05,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:13:05,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:13:05,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:13:05,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:13:05,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:13:05,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:13:05,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:13:05,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:13:05,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:13:05,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:13:05,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:13:05,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer 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 -> f18f7f1f917468e24f0e5d26966f1156107884dd [2019-11-15 20:13:05,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:13:05,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:13:05,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:13:05,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:13:05,127 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:13:05,128 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-15 20:13:05,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/data/3718ab2eb/b3049b92efc14b2a9dbe1fec7c305a48/FLAGc5036e903 [2019-11-15 20:13:05,596 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:13:05,596 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-15 20:13:05,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/data/3718ab2eb/b3049b92efc14b2a9dbe1fec7c305a48/FLAGc5036e903 [2019-11-15 20:13:05,919 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/data/3718ab2eb/b3049b92efc14b2a9dbe1fec7c305a48 [2019-11-15 20:13:05,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:13:05,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:13:05,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:13:05,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:13:05,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:13:05,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:13:05" (1/1) ... [2019-11-15 20:13:05,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32353742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:05, skipping insertion in model container [2019-11-15 20:13:05,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:13:05" (1/1) ... [2019-11-15 20:13:05,937 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:13:05,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:13:06,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:13:06,373 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:13:06,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:13:06,489 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:13:06,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06 WrapperNode [2019-11-15 20:13:06,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:13:06,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:13:06,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:13:06,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:13:06,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:13:06,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:13:06,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:13:06,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:13:06,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... [2019-11-15 20:13:06,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:13:06,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:13:06,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:13:06,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:13:06,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:13:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:13:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 20:13:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:13:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:13:07,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:13:07,274 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-15 20:13:07,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:13:07 BoogieIcfgContainer [2019-11-15 20:13:07,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:13:07,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:13:07,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:13:07,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:13:07,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:13:05" (1/3) ... [2019-11-15 20:13:07,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b105b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:13:07, skipping insertion in model container [2019-11-15 20:13:07,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:13:06" (2/3) ... [2019-11-15 20:13:07,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b105b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:13:07, skipping insertion in model container [2019-11-15 20:13:07,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:13:07" (3/3) ... [2019-11-15 20:13:07,284 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2019-11-15 20:13:07,294 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:13:07,305 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-15 20:13:07,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-15 20:13:07,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:13:07,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:13:07,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:13:07,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:13:07,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:13:07,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:13:07,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:13:07,343 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:13:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-15 20:13:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-15 20:13:07,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:07,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-15 20:13:07,380 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 20:13:07,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:07,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512223326] [2019-11-15 20:13:07,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:07,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512223326] [2019-11-15 20:13:07,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:07,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:13:07,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600631321] [2019-11-15 20:13:07,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:07,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:07,559 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-11-15 20:13:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:07,598 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-15 20:13:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:07,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-15 20:13:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:07,613 INFO L225 Difference]: With dead ends: 85 [2019-11-15 20:13:07,613 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 20:13:07,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 20:13:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 20:13:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:13:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-15 20:13:07,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-11-15 20:13:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:07,666 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-15 20:13:07,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-15 20:13:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:13:07,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:07,669 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:07,669 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-15 20:13:07,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:07,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071216534] [2019-11-15 20:13:07,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:07,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071216534] [2019-11-15 20:13:07,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:07,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:07,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868720628] [2019-11-15 20:13:07,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:07,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:07,785 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-11-15 20:13:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:07,909 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-15 20:13:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:07,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-15 20:13:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:07,911 INFO L225 Difference]: With dead ends: 64 [2019-11-15 20:13:07,911 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 20:13:07,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 20:13:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-15 20:13:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:13:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-15 20:13:07,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-11-15 20:13:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:07,918 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-15 20:13:07,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-15 20:13:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:13:07,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:07,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:07,920 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-15 20:13:07,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:07,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050456851] [2019-11-15 20:13:07,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:08,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050456851] [2019-11-15 20:13:08,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:08,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:08,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174160083] [2019-11-15 20:13:08,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:13:08,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:08,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:13:08,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:08,113 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-11-15 20:13:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:08,446 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-15 20:13:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:13:08,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 20:13:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:08,448 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:13:08,448 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 20:13:08,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:13:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 20:13:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-15 20:13:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:13:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-15 20:13:08,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-11-15 20:13:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:08,456 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-15 20:13:08,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:13:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-15 20:13:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:13:08,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:08,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:08,457 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-15 20:13:08,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:08,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244878419] [2019-11-15 20:13:08,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:08,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244878419] [2019-11-15 20:13:08,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:08,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:08,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895947047] [2019-11-15 20:13:08,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:08,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:08,540 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-11-15 20:13:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:08,595 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-15 20:13:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:08,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 20:13:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:08,597 INFO L225 Difference]: With dead ends: 63 [2019-11-15 20:13:08,597 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 20:13:08,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 20:13:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-15 20:13:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:13:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-15 20:13:08,604 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-11-15 20:13:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-15 20:13:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-15 20:13:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:13:08,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:08,606 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:08,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-15 20:13:08,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:08,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845464180] [2019-11-15 20:13:08,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:08,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845464180] [2019-11-15 20:13:08,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:08,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 20:13:08,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861009897] [2019-11-15 20:13:08,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:13:08,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:13:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:13:08,831 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-11-15 20:13:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:09,358 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-15 20:13:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:13:09,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-15 20:13:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:09,361 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:13:09,361 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 20:13:09,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:13:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 20:13:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-15 20:13:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 20:13:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-15 20:13:09,372 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-15 20:13:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:09,373 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-15 20:13:09,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:13:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-15 20:13:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:13:09,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:09,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:09,376 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-15 20:13:09,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:09,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170854361] [2019-11-15 20:13:09,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:09,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170854361] [2019-11-15 20:13:09,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:09,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:13:09,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408597471] [2019-11-15 20:13:09,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:13:09,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:13:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:09,559 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-11-15 20:13:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:09,844 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-15 20:13:09,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:13:09,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 20:13:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:09,846 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:13:09,846 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 20:13:09,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:13:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 20:13:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-15 20:13:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 20:13:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-15 20:13:09,853 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-11-15 20:13:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:09,853 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-15 20:13:09,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:13:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-15 20:13:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:13:09,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:09,855 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:09,855 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-15 20:13:09,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:09,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240392923] [2019-11-15 20:13:09,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:10,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240392923] [2019-11-15 20:13:10,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:13:10,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786509116] [2019-11-15 20:13:10,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:13:10,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:13:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:13:10,061 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-11-15 20:13:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:10,421 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-15 20:13:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:13:10,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-15 20:13:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:10,423 INFO L225 Difference]: With dead ends: 56 [2019-11-15 20:13:10,423 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:13:10,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:13:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:13:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-15 20:13:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 20:13:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-15 20:13:10,429 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-15 20:13:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:10,429 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-15 20:13:10,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:13:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-15 20:13:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:13:10,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:10,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:10,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-15 20:13:10,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:10,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883383012] [2019-11-15 20:13:10,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:10,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883383012] [2019-11-15 20:13:10,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 20:13:10,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935897035] [2019-11-15 20:13:10,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:13:10,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:13:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:13:10,655 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-11-15 20:13:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:11,191 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-15 20:13:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:13:11,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-15 20:13:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:11,195 INFO L225 Difference]: With dead ends: 55 [2019-11-15 20:13:11,195 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:13:11,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:13:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:13:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-15 20:13:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 20:13:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-15 20:13:11,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-11-15 20:13:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:11,201 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-15 20:13:11,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:13:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-15 20:13:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:13:11,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:11,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:11,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-15 20:13:11,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:11,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740730473] [2019-11-15 20:13:11,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:11,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740730473] [2019-11-15 20:13:11,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:11,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:11,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6245655] [2019-11-15 20:13:11,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:11,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:11,299 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-15 20:13:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:11,357 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-15 20:13:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:13:11,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-15 20:13:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:11,361 INFO L225 Difference]: With dead ends: 46 [2019-11-15 20:13:11,361 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 20:13:11,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 20:13:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-15 20:13:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 20:13:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-15 20:13:11,367 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-15 20:13:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:11,368 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-15 20:13:11,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-15 20:13:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:13:11,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:11,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:11,369 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-15 20:13:11,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:11,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929970193] [2019-11-15 20:13:11,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:11,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929970193] [2019-11-15 20:13:11,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:11,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 20:13:11,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648631056] [2019-11-15 20:13:11,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:13:11,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:13:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:13:11,526 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-11-15 20:13:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:12,008 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-15 20:13:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:13:12,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-15 20:13:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:12,010 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:13:12,010 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:13:12,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:13:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:13:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-11-15 20:13:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:13:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-15 20:13:12,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-11-15 20:13:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-15 20:13:12,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:13:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-15 20:13:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 20:13:12,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:12,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:12,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-11-15 20:13:12,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:12,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770806673] [2019-11-15 20:13:12,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:13:12,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770806673] [2019-11-15 20:13:12,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:12,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:13:12,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433729826] [2019-11-15 20:13:12,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:13:12,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:12,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:13:12,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:13:12,105 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-11-15 20:13:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:12,271 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-15 20:13:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:13:12,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-15 20:13:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:12,272 INFO L225 Difference]: With dead ends: 44 [2019-11-15 20:13:12,273 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 20:13:12,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:13:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 20:13:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-15 20:13:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 20:13:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-15 20:13:12,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-11-15 20:13:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:12,277 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-15 20:13:12,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:13:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-15 20:13:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 20:13:12,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:12,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:12,279 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-11-15 20:13:12,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:12,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611599840] [2019-11-15 20:13:12,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:13:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:13:12,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:13:12,363 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:13:12,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:13:12 BoogieIcfgContainer [2019-11-15 20:13:12,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:13:12,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:13:12,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:13:12,418 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:13:12,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:13:07" (3/4) ... [2019-11-15 20:13:12,420 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:13:12,476 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7cb916db-9f09-408d-ac63-bea247e7a4e4/bin/uautomizer/witness.graphml [2019-11-15 20:13:12,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:13:12,478 INFO L168 Benchmark]: Toolchain (without parser) took 6554.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,483 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:13:12,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,484 INFO L168 Benchmark]: Boogie Preprocessor took 33.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:13:12,485 INFO L168 Benchmark]: RCFGBuilder took 681.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,485 INFO L168 Benchmark]: TraceAbstraction took 5140.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,486 INFO L168 Benchmark]: Witness Printer took 58.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:12,488 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 566.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 681.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5140.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Witness Printer took 58.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L903] struct list_head *dev1, *dev2; [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L879] return __getMemory(size); [L904] dev1 = my_malloc(sizeof(*dev1)) [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={1:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L879] return __getMemory(size); [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L896] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] [L6] __VERIFIER_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 6 error locations. Result: UNSAFE, OverallTime: 5.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 1037 SDslu, 725 SDs, 0 SdLazy, 1052 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 19201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...