./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-memsafety/fillarray1_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_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/fillarray1_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/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 cfe359172ad2672387c82471e6d5c8b8ec22ae94 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 01:45:17,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:45:17,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:45:17,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:45:17,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:45:17,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:45:17,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:45:17,630 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:45:17,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:45:17,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:45:17,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:45:17,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:45:17,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:45:17,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:45:17,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:45:17,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:45:17,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:45:17,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:45:17,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:45:17,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:45:17,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:45:17,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:45:17,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:45:17,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:45:17,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:45:17,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:45:17,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:45:17,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:45:17,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:45:17,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:45:17,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:45:17,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:45:17,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:45:17,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:45:17,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:45:17,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:45:17,642 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 01:45:17,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:45:17,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:45:17,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:45:17,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:45:17,650 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:45:17,651 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:45:17,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:45:17,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:45:17,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:45:17,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:45:17,651 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:45:17,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:45:17,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:45:17,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:45:17,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:45:17,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:45:17,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:45:17,653 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:45:17,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:45:17,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:45:17,653 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_03bd3e50-7fef-49b3-971b-0f130b035d33/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 -> cfe359172ad2672387c82471e6d5c8b8ec22ae94 [2018-12-02 01:45:17,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:45:17,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:45:17,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:45:17,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:45:17,684 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:45:17,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/../../sv-benchmarks/c/pthread-memsafety/fillarray1_false-valid-deref.i [2018-12-02 01:45:17,731 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/data/651b80f2c/7776d2386720419c958cc9e220f2a334/FLAG22747b770 [2018-12-02 01:45:18,107 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:45:18,108 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/sv-benchmarks/c/pthread-memsafety/fillarray1_false-valid-deref.i [2018-12-02 01:45:18,115 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/data/651b80f2c/7776d2386720419c958cc9e220f2a334/FLAG22747b770 [2018-12-02 01:45:18,123 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/data/651b80f2c/7776d2386720419c958cc9e220f2a334 [2018-12-02 01:45:18,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:45:18,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:45:18,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:45:18,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:45:18,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:45:18,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18, skipping insertion in model container [2018-12-02 01:45:18,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:45:18,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:45:18,411 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:45:18,417 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:45:18,443 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:45:18,493 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:45:18,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18 WrapperNode [2018-12-02 01:45:18,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:45:18,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:45:18,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:45:18,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:45:18,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:45:18,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:45:18,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:45:18,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:45:18,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... [2018-12-02 01:45:18,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:45:18,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:45:18,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:45:18,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:45:18,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/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-02 01:45:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-12-02 01:45:18,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-12-02 01:45:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-12-02 01:45:18,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-12-02 01:45:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:45:18,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:45:18,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:45:18,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:45:18,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:45:18,570 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 01:45:18,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:45:18,750 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 01:45:18,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:45:18 BoogieIcfgContainer [2018-12-02 01:45:18,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:45:18,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:45:18,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:45:18,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:45:18,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:45:18" (1/3) ... [2018-12-02 01:45:18,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfd24ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:45:18, skipping insertion in model container [2018-12-02 01:45:18,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:45:18" (2/3) ... [2018-12-02 01:45:18,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfd24ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:45:18, skipping insertion in model container [2018-12-02 01:45:18,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:45:18" (3/3) ... [2018-12-02 01:45:18,754 INFO L112 eAbstractionObserver]: Analyzing ICFG fillarray1_false-valid-deref.i [2018-12-02 01:45:18,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,777 WARN L317 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:45:18,782 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:45:18,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 01:45:18,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 01:45:18,811 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:45:18,811 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 01:45:18,811 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:45:18,811 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:45:18,811 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:45:18,811 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:45:18,811 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:45:18,811 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:45:18,818 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83places, 89 transitions [2018-12-02 01:45:18,906 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4467 states. [2018-12-02 01:45:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states. [2018-12-02 01:45:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 01:45:18,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:18,912 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] [2018-12-02 01:45:18,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1290096633, now seen corresponding path program 1 times [2018-12-02 01:45:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:18,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:18,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:19,028 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-02 01:45:19,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:19,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:45:19,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:19,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:45:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:45:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:45:19,042 INFO L87 Difference]: Start difference. First operand 4467 states. Second operand 3 states. [2018-12-02 01:45:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:19,144 INFO L93 Difference]: Finished difference Result 4466 states and 13543 transitions. [2018-12-02 01:45:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:45:19,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 01:45:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:19,171 INFO L225 Difference]: With dead ends: 4466 [2018-12-02 01:45:19,171 INFO L226 Difference]: Without dead ends: 4396 [2018-12-02 01:45:19,172 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-02 01:45:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2018-12-02 01:45:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4396. [2018-12-02 01:45:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4396 states. [2018-12-02 01:45:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4396 states to 4396 states and 13345 transitions. [2018-12-02 01:45:19,303 INFO L78 Accepts]: Start accepts. Automaton has 4396 states and 13345 transitions. Word has length 21 [2018-12-02 01:45:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:19,303 INFO L480 AbstractCegarLoop]: Abstraction has 4396 states and 13345 transitions. [2018-12-02 01:45:19,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:45:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4396 states and 13345 transitions. [2018-12-02 01:45:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 01:45:19,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:19,303 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-02 01:45:19,304 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:19,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1168096473, now seen corresponding path program 1 times [2018-12-02 01:45:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:19,354 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-02 01:45:19,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:45:19,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:19,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:45:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:45:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:45:19,355 INFO L87 Difference]: Start difference. First operand 4396 states and 13345 transitions. Second operand 3 states. [2018-12-02 01:45:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:19,426 INFO L93 Difference]: Finished difference Result 4395 states and 13344 transitions. [2018-12-02 01:45:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:45:19,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 01:45:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:19,444 INFO L225 Difference]: With dead ends: 4395 [2018-12-02 01:45:19,444 INFO L226 Difference]: Without dead ends: 4395 [2018-12-02 01:45:19,445 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-02 01:45:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2018-12-02 01:45:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4395. [2018-12-02 01:45:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2018-12-02 01:45:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 13344 transitions. [2018-12-02 01:45:19,534 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 13344 transitions. Word has length 25 [2018-12-02 01:45:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:19,534 INFO L480 AbstractCegarLoop]: Abstraction has 4395 states and 13344 transitions. [2018-12-02 01:45:19,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:45:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 13344 transitions. [2018-12-02 01:45:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 01:45:19,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:19,534 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-02 01:45:19,535 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:19,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1168096474, now seen corresponding path program 1 times [2018-12-02 01:45:19,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:19,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:19,587 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-02 01:45:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:45:19,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:45:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:45:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:45:19,588 INFO L87 Difference]: Start difference. First operand 4395 states and 13344 transitions. Second operand 4 states. [2018-12-02 01:45:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:19,653 INFO L93 Difference]: Finished difference Result 4394 states and 13343 transitions. [2018-12-02 01:45:19,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:45:19,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 01:45:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:19,664 INFO L225 Difference]: With dead ends: 4394 [2018-12-02 01:45:19,665 INFO L226 Difference]: Without dead ends: 4394 [2018-12-02 01:45:19,665 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-02 01:45:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2018-12-02 01:45:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4394. [2018-12-02 01:45:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4394 states. [2018-12-02 01:45:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 13343 transitions. [2018-12-02 01:45:19,722 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 13343 transitions. Word has length 25 [2018-12-02 01:45:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:19,722 INFO L480 AbstractCegarLoop]: Abstraction has 4394 states and 13343 transitions. [2018-12-02 01:45:19,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:45:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 13343 transitions. [2018-12-02 01:45:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 01:45:19,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:19,723 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-02 01:45:19,723 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:19,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash 937214901, now seen corresponding path program 1 times [2018-12-02 01:45:19,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:19,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:19,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:19,742 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-02 01:45:19,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:19,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:45:19,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:19,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:45:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:45:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:45:19,743 INFO L87 Difference]: Start difference. First operand 4394 states and 13343 transitions. Second operand 3 states. [2018-12-02 01:45:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:19,797 INFO L93 Difference]: Finished difference Result 4378 states and 13310 transitions. [2018-12-02 01:45:19,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:45:19,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 01:45:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:19,812 INFO L225 Difference]: With dead ends: 4378 [2018-12-02 01:45:19,812 INFO L226 Difference]: Without dead ends: 4378 [2018-12-02 01:45:19,812 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-02 01:45:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2018-12-02 01:45:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4378. [2018-12-02 01:45:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2018-12-02 01:45:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 13310 transitions. [2018-12-02 01:45:19,879 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 13310 transitions. Word has length 28 [2018-12-02 01:45:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:19,879 INFO L480 AbstractCegarLoop]: Abstraction has 4378 states and 13310 transitions. [2018-12-02 01:45:19,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:45:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 13310 transitions. [2018-12-02 01:45:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 01:45:19,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:19,880 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-02 01:45:19,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:19,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 937214902, now seen corresponding path program 1 times [2018-12-02 01:45:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:19,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:19,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:19,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:19,915 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-02 01:45:19,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:45:19,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:19,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:45:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:45:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:45:19,916 INFO L87 Difference]: Start difference. First operand 4378 states and 13310 transitions. Second operand 3 states. [2018-12-02 01:45:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:19,946 INFO L93 Difference]: Finished difference Result 4362 states and 13277 transitions. [2018-12-02 01:45:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:45:19,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 01:45:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:19,958 INFO L225 Difference]: With dead ends: 4362 [2018-12-02 01:45:19,959 INFO L226 Difference]: Without dead ends: 4362 [2018-12-02 01:45:19,959 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-02 01:45:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2018-12-02 01:45:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 4362. [2018-12-02 01:45:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4362 states. [2018-12-02 01:45:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 13277 transitions. [2018-12-02 01:45:20,009 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 13277 transitions. Word has length 28 [2018-12-02 01:45:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:20,009 INFO L480 AbstractCegarLoop]: Abstraction has 4362 states and 13277 transitions. [2018-12-02 01:45:20,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:45:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 13277 transitions. [2018-12-02 01:45:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 01:45:20,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:20,010 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, 1] [2018-12-02 01:45:20,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:20,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1013054056, now seen corresponding path program 1 times [2018-12-02 01:45:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:20,042 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-02 01:45:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:45:20,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:20,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:45:20,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:45:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:45:20,043 INFO L87 Difference]: Start difference. First operand 4362 states and 13277 transitions. Second operand 4 states. [2018-12-02 01:45:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:20,062 INFO L93 Difference]: Finished difference Result 4106 states and 12477 transitions. [2018-12-02 01:45:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:45:20,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-02 01:45:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:20,069 INFO L225 Difference]: With dead ends: 4106 [2018-12-02 01:45:20,069 INFO L226 Difference]: Without dead ends: 4106 [2018-12-02 01:45:20,069 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-02 01:45:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-02 01:45:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4106. [2018-12-02 01:45:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2018-12-02 01:45:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 12477 transitions. [2018-12-02 01:45:20,129 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 12477 transitions. Word has length 31 [2018-12-02 01:45:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:20,129 INFO L480 AbstractCegarLoop]: Abstraction has 4106 states and 12477 transitions. [2018-12-02 01:45:20,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:45:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 12477 transitions. [2018-12-02 01:45:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 01:45:20,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:20,130 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, 1, 1] [2018-12-02 01:45:20,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1339904448, now seen corresponding path program 1 times [2018-12-02 01:45:20,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:20,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:20,183 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-02 01:45:20,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:20,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:45:20,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:20,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:45:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:45:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:45:20,184 INFO L87 Difference]: Start difference. First operand 4106 states and 12477 transitions. Second operand 7 states. [2018-12-02 01:45:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:20,234 INFO L93 Difference]: Finished difference Result 3850 states and 11677 transitions. [2018-12-02 01:45:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:45:20,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-12-02 01:45:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:20,240 INFO L225 Difference]: With dead ends: 3850 [2018-12-02 01:45:20,241 INFO L226 Difference]: Without dead ends: 3850 [2018-12-02 01:45:20,241 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-02 01:45:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2018-12-02 01:45:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2018-12-02 01:45:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2018-12-02 01:45:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 11677 transitions. [2018-12-02 01:45:20,284 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 11677 transitions. Word has length 32 [2018-12-02 01:45:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:20,285 INFO L480 AbstractCegarLoop]: Abstraction has 3850 states and 11677 transitions. [2018-12-02 01:45:20,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:45:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 11677 transitions. [2018-12-02 01:45:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 01:45:20,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:20,286 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, 1, 1, 1, 1, 1, 1] [2018-12-02 01:45:20,286 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:20,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1009267215, now seen corresponding path program 1 times [2018-12-02 01:45:20,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:20,342 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-02 01:45:20,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:20,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:45:20,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:20,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:45:20,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:45:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:45:20,343 INFO L87 Difference]: Start difference. First operand 3850 states and 11677 transitions. Second operand 8 states. [2018-12-02 01:45:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:20,486 INFO L93 Difference]: Finished difference Result 5479 states and 16513 transitions. [2018-12-02 01:45:20,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:45:20,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-02 01:45:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:20,496 INFO L225 Difference]: With dead ends: 5479 [2018-12-02 01:45:20,496 INFO L226 Difference]: Without dead ends: 5479 [2018-12-02 01:45:20,496 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-02 01:45:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2018-12-02 01:45:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 4663. [2018-12-02 01:45:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2018-12-02 01:45:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 14426 transitions. [2018-12-02 01:45:20,576 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 14426 transitions. Word has length 36 [2018-12-02 01:45:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:20,576 INFO L480 AbstractCegarLoop]: Abstraction has 4663 states and 14426 transitions. [2018-12-02 01:45:20,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:45:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 14426 transitions. [2018-12-02 01:45:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 01:45:20,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:20,578 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, 1, 1, 1, 1, 1, 1] [2018-12-02 01:45:20,578 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-02 01:45:20,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1009267214, now seen corresponding path program 1 times [2018-12-02 01:45:20,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:20,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:20,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:20,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:45:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:45:20,618 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:45:20,652 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 01:45:20,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:45:20 BasicIcfg [2018-12-02 01:45:20,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:45:20,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:45:20,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:45:20,654 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:45:20,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:45:18" (3/4) ... [2018-12-02 01:45:20,656 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:45:20,701 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_03bd3e50-7fef-49b3-971b-0f130b035d33/bin-2019/utaipan/witness.graphml [2018-12-02 01:45:20,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:45:20,702 INFO L168 Benchmark]: Toolchain (without parser) took 2576.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 948.1 MB in the beginning and 956.3 MB in the end (delta: -8.2 MB). Peak memory consumption was 194.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,703 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:45:20,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.83 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.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,704 INFO L168 Benchmark]: Boogie Preprocessor took 15.97 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.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,704 INFO L168 Benchmark]: RCFGBuilder took 213.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,705 INFO L168 Benchmark]: TraceAbstraction took 1902.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.0 GB in the beginning and 961.7 MB in the end (delta: 84.4 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,705 INFO L168 Benchmark]: Witness Printer took 47.82 ms. Allocated memory is still 1.2 GB. Free memory was 961.7 MB in the beginning and 956.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:45:20,707 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.83 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.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.97 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.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 213.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1902.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.0 GB in the beginning and 961.7 MB in the end (delta: 84.4 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * Witness Printer took 47.82 ms. Allocated memory is still 1.2 GB. Free memory was 961.7 MB in the beginning and 956.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1049]: 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] [L1040] -1 int x, y, z; VAL [i=1, ind=0, j=2, size=0, x=0, y=0, z=0] [L1068] -1 size = __VERIFIER_nondet_int() VAL [i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1069] COND FALSE -1 !(size < 1 || size > 20) VAL [i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1072] -1 int *a = (int *)malloc(size); VAL [i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1073] -1 pthread_t id1, id2; VAL [i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1074] -1 ind = 0 VAL [i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1075] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, a) VAL [arg={10:0}, i=1, ind=0, j=2, size=2, x=0, y=0, z=0] [L1042] 0 x = 1 VAL [arg={10:0}, arg={10:0}, i=1, ind=0, j=2, size=2, x=1, y=0, z=0] [L1043] 0 y = 1 VAL [arg={10:0}, arg={10:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1044] 0 int *a = (int *)arg; VAL [a={10:0}, arg={10:0}, arg={10:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1045] COND FALSE 0 !(y == 1 && z) VAL [a={10:0}, arg={10:0}, arg={10:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1047] COND TRUE 0 ind < size - 1 VAL [a={10:0}, arg={10:0}, arg={10:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1048] 0 ++ind VAL [a={10:0}, arg={10:0}, arg={10:0}, i=1, ind=1, j=2, size=2, x=1, y=1, z=0] [L1049] 0 a[ind] = i - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 15 error locations. UNSAFE Result, 1.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 631 SDtfs, 718 SDslu, 889 SDs, 0 SdLazy, 372 SolverSat, 17 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=4663occurred 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.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 816 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 14878 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...