./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 317acdded5b2f05710e753bf8fd3c2308f1aec62 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 05:08:57,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:08:57,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:08:57,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:08:57,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:08:57,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:08:57,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:08:57,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:08:57,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:08:57,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:08:57,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:08:57,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:08:57,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:08:57,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:08:57,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:08:57,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:08:57,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:08:57,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:08:57,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:08:57,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:08:57,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:08:57,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:08:57,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:08:57,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:08:57,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:08:57,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:08:57,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:08:57,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:08:57,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:08:57,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:08:57,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:08:57,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:08:57,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:08:57,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:08:57,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:08:57,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:08:57,462 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 05:08:57,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:08:57,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:08:57,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:08:57,470 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:08:57,470 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:08:57,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:08:57,470 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:08:57,470 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:08:57,471 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:08:57,471 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:08:57,471 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:08:57,471 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:08:57,471 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:08:57,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 05:08:57,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:08:57,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:08:57,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:08:57,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:08:57,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:08:57,474 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 317acdded5b2f05710e753bf8fd3c2308f1aec62 [2018-12-03 05:08:57,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:08:57,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:08:57,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:08:57,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:08:57,503 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:08:57,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i [2018-12-03 05:08:57,540 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/data/9f1d856e8/7fc6a93934cd4d9989f222af0f7fd3fc/FLAG0a8e995b3 [2018-12-03 05:08:58,009 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:08:58,010 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i [2018-12-03 05:08:58,018 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/data/9f1d856e8/7fc6a93934cd4d9989f222af0f7fd3fc/FLAG0a8e995b3 [2018-12-03 05:08:58,027 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/data/9f1d856e8/7fc6a93934cd4d9989f222af0f7fd3fc [2018-12-03 05:08:58,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:08:58,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:08:58,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:08:58,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:08:58,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:08:58,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58, skipping insertion in model container [2018-12-03 05:08:58,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:08:58,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:08:58,334 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:08:58,339 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:08:58,365 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:08:58,414 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:08:58,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58 WrapperNode [2018-12-03 05:08:58,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:08:58,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:08:58,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:08:58,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:08:58,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:08:58,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:08:58,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:08:58,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:08:58,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... [2018-12-03 05:08:58,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:08:58,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:08:58,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:08:58,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:08:58,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/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-12-03 05:08:58,488 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-12-03 05:08:58,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-12-03 05:08:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-12-03 05:08:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-12-03 05:08:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:08:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:08:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:08:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:08:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:08:58,490 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 05:08:58,667 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:08:58,667 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 05:08:58,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:58 BoogieIcfgContainer [2018-12-03 05:08:58,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:08:58,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:08:58,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:08:58,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:08:58,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:08:58" (1/3) ... [2018-12-03 05:08:58,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b168368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:08:58, skipping insertion in model container [2018-12-03 05:08:58,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:08:58" (2/3) ... [2018-12-03 05:08:58,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b168368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:08:58, skipping insertion in model container [2018-12-03 05:08:58,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:58" (3/3) ... [2018-12-03 05:08:58,673 INFO L112 eAbstractionObserver]: Analyzing ICFG fillarray_false-valid-deref.i [2018-12-03 05:08:58,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,699 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,699 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,700 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,701 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,703 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:08:58,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:08:58,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-03 05:08:58,724 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-03 05:08:58,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:08:58,739 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 05:08:58,739 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:08:58,739 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:08:58,739 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:08:58,740 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:08:58,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:08:58,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:08:58,748 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72places, 74 transitions [2018-12-03 05:08:58,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2540 states. [2018-12-03 05:08:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states. [2018-12-03 05:08:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 05:08:58,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:58,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:58,820 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:58,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash -635543380, now seen corresponding path program 1 times [2018-12-03 05:08:58,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:58,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:58,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:08:58,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:58,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:08:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:08:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:58,964 INFO L87 Difference]: Start difference. First operand 2540 states. Second operand 3 states. [2018-12-03 05:08:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,044 INFO L93 Difference]: Finished difference Result 2539 states and 7351 transitions. [2018-12-03 05:08:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:08:59,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 05:08:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,063 INFO L225 Difference]: With dead ends: 2539 [2018-12-03 05:08:59,064 INFO L226 Difference]: Without dead ends: 2497 [2018-12-03 05:08:59,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-12-03 05:08:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2497. [2018-12-03 05:08:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2497 states. [2018-12-03 05:08:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 7237 transitions. [2018-12-03 05:08:59,169 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 7237 transitions. Word has length 18 [2018-12-03 05:08:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,169 INFO L480 AbstractCegarLoop]: Abstraction has 2497 states and 7237 transitions. [2018-12-03 05:08:59,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:08:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 7237 transitions. [2018-12-03 05:08:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 05:08:59,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,170 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -66291374, now seen corresponding path program 1 times [2018-12-03 05:08:59,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:08:59,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:08:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:08:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,241 INFO L87 Difference]: Start difference. First operand 2497 states and 7237 transitions. Second operand 3 states. [2018-12-03 05:08:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,294 INFO L93 Difference]: Finished difference Result 2496 states and 7236 transitions. [2018-12-03 05:08:59,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:08:59,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 05:08:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,305 INFO L225 Difference]: With dead ends: 2496 [2018-12-03 05:08:59,305 INFO L226 Difference]: Without dead ends: 2496 [2018-12-03 05:08:59,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-12-03 05:08:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2018-12-03 05:08:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2018-12-03 05:08:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 7236 transitions. [2018-12-03 05:08:59,353 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 7236 transitions. Word has length 22 [2018-12-03 05:08:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,353 INFO L480 AbstractCegarLoop]: Abstraction has 2496 states and 7236 transitions. [2018-12-03 05:08:59,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:08:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 7236 transitions. [2018-12-03 05:08:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 05:08:59,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash -66291373, now seen corresponding path program 1 times [2018-12-03 05:08:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:08:59,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:08:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:08:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:08:59,416 INFO L87 Difference]: Start difference. First operand 2496 states and 7236 transitions. Second operand 4 states. [2018-12-03 05:08:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,479 INFO L93 Difference]: Finished difference Result 2495 states and 7235 transitions. [2018-12-03 05:08:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:08:59,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-03 05:08:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,489 INFO L225 Difference]: With dead ends: 2495 [2018-12-03 05:08:59,490 INFO L226 Difference]: Without dead ends: 2495 [2018-12-03 05:08:59,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:08:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-12-03 05:08:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2018-12-03 05:08:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-03 05:08:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 7235 transitions. [2018-12-03 05:08:59,549 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 7235 transitions. Word has length 22 [2018-12-03 05:08:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,549 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 7235 transitions. [2018-12-03 05:08:59,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:08:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 7235 transitions. [2018-12-03 05:08:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 05:08:59,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,550 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 798797317, now seen corresponding path program 1 times [2018-12-03 05:08:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:08:59,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:08:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:08:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,583 INFO L87 Difference]: Start difference. First operand 2495 states and 7235 transitions. Second operand 3 states. [2018-12-03 05:08:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,617 INFO L93 Difference]: Finished difference Result 2483 states and 7211 transitions. [2018-12-03 05:08:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:08:59,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 05:08:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,623 INFO L225 Difference]: With dead ends: 2483 [2018-12-03 05:08:59,623 INFO L226 Difference]: Without dead ends: 2483 [2018-12-03 05:08:59,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-12-03 05:08:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2018-12-03 05:08:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2018-12-03 05:08:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 7211 transitions. [2018-12-03 05:08:59,657 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 7211 transitions. Word has length 25 [2018-12-03 05:08:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,658 INFO L480 AbstractCegarLoop]: Abstraction has 2483 states and 7211 transitions. [2018-12-03 05:08:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:08:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 7211 transitions. [2018-12-03 05:08:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 05:08:59,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,659 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash 798797318, now seen corresponding path program 1 times [2018-12-03 05:08:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 05:08:59,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:08:59,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:08:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,693 INFO L87 Difference]: Start difference. First operand 2483 states and 7211 transitions. Second operand 3 states. [2018-12-03 05:08:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,720 INFO L93 Difference]: Finished difference Result 2471 states and 7187 transitions. [2018-12-03 05:08:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:08:59,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 05:08:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,727 INFO L225 Difference]: With dead ends: 2471 [2018-12-03 05:08:59,727 INFO L226 Difference]: Without dead ends: 2471 [2018-12-03 05:08:59,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:08:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2018-12-03 05:08:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2018-12-03 05:08:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-12-03 05:08:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 7187 transitions. [2018-12-03 05:08:59,778 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 7187 transitions. Word has length 25 [2018-12-03 05:08:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,778 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 7187 transitions. [2018-12-03 05:08:59,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:08:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 7187 transitions. [2018-12-03 05:08:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 05:08:59,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,779 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1442752698, now seen corresponding path program 1 times [2018-12-03 05:08:59,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:08:59,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:08:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:08:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:08:59,820 INFO L87 Difference]: Start difference. First operand 2471 states and 7187 transitions. Second operand 4 states. [2018-12-03 05:08:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:08:59,840 INFO L93 Difference]: Finished difference Result 2327 states and 6755 transitions. [2018-12-03 05:08:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:08:59,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-03 05:08:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:08:59,850 INFO L225 Difference]: With dead ends: 2327 [2018-12-03 05:08:59,850 INFO L226 Difference]: Without dead ends: 2327 [2018-12-03 05:08:59,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:08:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2018-12-03 05:08:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2327. [2018-12-03 05:08:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-12-03 05:08:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 6755 transitions. [2018-12-03 05:08:59,901 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 6755 transitions. Word has length 28 [2018-12-03 05:08:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:08:59,902 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 6755 transitions. [2018-12-03 05:08:59,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:08:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 6755 transitions. [2018-12-03 05:08:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 05:08:59,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:08:59,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:08:59,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:08:59,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:08:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1775660498, now seen corresponding path program 1 times [2018-12-03 05:08:59,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:08:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:08:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:08:59,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:08:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:08:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:08:59,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:08:59,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:08:59,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:08:59,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:08:59,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:08:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:08:59,960 INFO L87 Difference]: Start difference. First operand 2327 states and 6755 transitions. Second operand 7 states. [2018-12-03 05:09:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:09:00,006 INFO L93 Difference]: Finished difference Result 2183 states and 6323 transitions. [2018-12-03 05:09:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:09:00,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-03 05:09:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:09:00,010 INFO L225 Difference]: With dead ends: 2183 [2018-12-03 05:09:00,011 INFO L226 Difference]: Without dead ends: 2183 [2018-12-03 05:09:00,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:09:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2018-12-03 05:09:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2183. [2018-12-03 05:09:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2018-12-03 05:09:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 6323 transitions. [2018-12-03 05:09:00,033 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 6323 transitions. Word has length 29 [2018-12-03 05:09:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:09:00,033 INFO L480 AbstractCegarLoop]: Abstraction has 2183 states and 6323 transitions. [2018-12-03 05:09:00,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:09:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 6323 transitions. [2018-12-03 05:09:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:09:00,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:09:00,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:09:00,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:09:00,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:09:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1335077213, now seen corresponding path program 1 times [2018-12-03 05:09:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:09:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:09:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:09:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:09:00,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:09:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:09:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:09:00,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:09:00,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:09:00,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:09:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:09:00,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:09:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:09:00,082 INFO L87 Difference]: Start difference. First operand 2183 states and 6323 transitions. Second operand 8 states. [2018-12-03 05:09:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:09:00,232 INFO L93 Difference]: Finished difference Result 3284 states and 9521 transitions. [2018-12-03 05:09:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:09:00,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 05:09:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:09:00,237 INFO L225 Difference]: With dead ends: 3284 [2018-12-03 05:09:00,237 INFO L226 Difference]: Without dead ends: 3284 [2018-12-03 05:09:00,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:09:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-12-03 05:09:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2792. [2018-12-03 05:09:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2018-12-03 05:09:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 8345 transitions. [2018-12-03 05:09:00,275 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 8345 transitions. Word has length 30 [2018-12-03 05:09:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:09:00,275 INFO L480 AbstractCegarLoop]: Abstraction has 2792 states and 8345 transitions. [2018-12-03 05:09:00,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:09:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 8345 transitions. [2018-12-03 05:09:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:09:00,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:09:00,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:09:00,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-03 05:09:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:09:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1335077214, now seen corresponding path program 1 times [2018-12-03 05:09:00,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:09:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:09:00,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:09:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:09:00,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:09:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:09:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:09:00,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 05:09:00,325 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 05:09:00,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:09:00 BasicIcfg [2018-12-03 05:09:00,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:09:00,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:09:00,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:09:00,326 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:09:00,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:08:58" (3/4) ... [2018-12-03 05:09:00,328 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 05:09:00,357 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e5d87805-282e-4157-9cc0-8c0b4878da2f/bin-2019/utaipan/witness.graphml [2018-12-03 05:09:00,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:09:00,358 INFO L168 Benchmark]: Toolchain (without parser) took 2329.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 948.1 MB in the beginning and 1.0 GB in the end (delta: -93.6 MB). Peak memory consumption was 142.4 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:09:00,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -116.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:09:00,360 INFO L168 Benchmark]: Boogie Preprocessor took 15.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,361 INFO L168 Benchmark]: RCFGBuilder took 209.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,361 INFO L168 Benchmark]: TraceAbstraction took 1657.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -23.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,361 INFO L168 Benchmark]: Witness Printer took 31.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:09:00,363 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -116.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1657.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -23.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. * Witness Printer took 31.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1044]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1037] -1 int size; VAL [size=0] [L1038] -1 int ind; VAL [ind=0, size=0] [L1039] -1 int j = 2, i = 1; VAL [i=1, ind=0, j=2, size=0] [L1057] -1 size = __VERIFIER_nondet_int() VAL [i=1, ind=0, j=2, size=2] [L1058] COND FALSE -1 !(size < 1 || size > 20) VAL [i=1, ind=0, j=2, size=2] [L1061] -1 int *a = (int *)malloc(size); VAL [i=1, ind=0, j=2, size=2] [L1062] -1 pthread_t id1, id2; VAL [i=1, ind=0, j=2, size=2] [L1063] -1 ind = 0 VAL [i=1, ind=0, j=2, size=2] [L1064] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, a) VAL [arg={6:0}, i=1, ind=0, j=2, size=2] [L1041] 0 int *a = (int *)arg; VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=0, j=2, size=2] [L1042] COND TRUE 0 ind < size - 1 VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=0, j=2, size=2] [L1043] 0 ++ind VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=1, j=2, size=2] [L1044] 0 a[ind] = i - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 96 locations, 15 error locations. UNSAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 549 SDslu, 768 SDs, 0 SdLazy, 413 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2792occurred 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 492 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 11986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...