./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cde79280316325d2d59345170ff2a64a15955ff ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:17:11,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:17:11,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:17:11,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:17:11,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:17:11,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:17:11,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:17:11,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:17:11,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:17:11,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:17:11,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:17:11,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:17:11,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:17:11,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:17:11,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:17:11,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:17:11,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:17:11,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:17:11,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:17:11,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:17:11,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:17:11,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:17:11,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:17:11,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:17:11,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:17:11,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:17:11,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:17:11,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:17:11,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:17:11,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:17:11,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:17:11,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:17:11,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:17:11,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:17:11,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:17:11,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:17:11,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:17:11,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:17:11,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:17:11,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:17:11,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:17:11,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:17:11,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:17:11,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:17:11,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:17:11,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:17:11,069 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:17:11,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:17:11,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:17:11,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:17:11,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:17:11,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:17:11,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:17:11,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:17:11,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9cde79280316325d2d59345170ff2a64a15955ff [2019-12-07 18:17:11,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:17:11,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:17:11,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:17:11,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:17:11,182 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:17:11,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i [2019-12-07 18:17:11,219 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/data/62ebcaf95/9ec50df2b800436d8a5b8d80981b2078/FLAG0304c077e [2019-12-07 18:17:11,676 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:17:11,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i [2019-12-07 18:17:11,687 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/data/62ebcaf95/9ec50df2b800436d8a5b8d80981b2078/FLAG0304c077e [2019-12-07 18:17:11,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/data/62ebcaf95/9ec50df2b800436d8a5b8d80981b2078 [2019-12-07 18:17:11,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:17:11,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:17:11,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:17:11,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:17:11,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:17:11,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:17:11" (1/1) ... [2019-12-07 18:17:11,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:11, skipping insertion in model container [2019-12-07 18:17:11,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:17:11" (1/1) ... [2019-12-07 18:17:11,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:17:11,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:17:11,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:17:11,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:17:12,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:17:12,067 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:17:12,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12 WrapperNode [2019-12-07 18:17:12,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:17:12,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:17:12,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:17:12,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:17:12,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:17:12,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:17:12,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:17:12,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:17:12,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... [2019-12-07 18:17:12,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:17:12,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:17:12,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:17:12,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:17:12,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:17:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:17:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:17:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:17:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:17:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:17:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:17:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:17:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:17:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:17:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:17:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:17:12,180 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:17:12,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:17:12,530 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:17:12,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:17:12 BoogieIcfgContainer [2019-12-07 18:17:12,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:17:12,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:17:12,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:17:12,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:17:12,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:17:11" (1/3) ... [2019-12-07 18:17:12,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8461e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:17:12, skipping insertion in model container [2019-12-07 18:17:12,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:17:12" (2/3) ... [2019-12-07 18:17:12,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8461e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:17:12, skipping insertion in model container [2019-12-07 18:17:12,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:17:12" (3/3) ... [2019-12-07 18:17:12,536 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2019-12-07 18:17:12,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:17:12,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:17:12,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:17:12,548 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:17:12,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:17:12,615 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:17:12,615 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:17:12,615 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:17:12,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:17:12,616 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:17:12,616 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:17:12,616 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:17:12,616 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:17:12,626 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-07 18:17:12,627 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 18:17:12,671 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 18:17:12,671 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:17:12,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 18:17:12,690 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 18:17:12,711 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 18:17:12,711 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:17:12,715 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 18:17:12,723 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 18:17:12,724 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:17:15,222 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 18:17:15,310 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-07 18:17:15,310 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-07 18:17:15,312 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-07 18:17:15,542 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-07 18:17:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-07 18:17:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:17:15,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:15,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:17:15,549 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:15,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-07 18:17:15,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:15,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655501649] [2019-12-07 18:17:15,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:15,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655501649] [2019-12-07 18:17:15,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:15,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:17:15,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749736715] [2019-12-07 18:17:15,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:15,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:15,736 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-07 18:17:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:15,891 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-07 18:17:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:17:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:15,965 INFO L225 Difference]: With dead ends: 5990 [2019-12-07 18:17:15,965 INFO L226 Difference]: Without dead ends: 5642 [2019-12-07 18:17:15,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-07 18:17:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-07 18:17:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 18:17:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-07 18:17:16,206 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-07 18:17:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:16,207 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-07 18:17:16,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-07 18:17:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:17:16,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:16,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:16,210 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-07 18:17:16,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:16,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928409964] [2019-12-07 18:17:16,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:16,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928409964] [2019-12-07 18:17:16,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:16,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:16,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807516099] [2019-12-07 18:17:16,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:17:16,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:16,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:16,280 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-12-07 18:17:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:16,488 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-12-07 18:17:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:17:16,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:17:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:16,539 INFO L225 Difference]: With dead ends: 8500 [2019-12-07 18:17:16,540 INFO L226 Difference]: Without dead ends: 8487 [2019-12-07 18:17:16,540 INFO L630 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 [2019-12-07 18:17:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-07 18:17:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-12-07 18:17:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-07 18:17:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-12-07 18:17:16,720 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-12-07 18:17:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:16,720 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-12-07 18:17:16,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:17:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-12-07 18:17:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:17:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:16,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:16,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-07 18:17:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:16,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299102305] [2019-12-07 18:17:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:16,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299102305] [2019-12-07 18:17:16,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:16,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:16,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578623699] [2019-12-07 18:17:16,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:16,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:16,762 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-12-07 18:17:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:16,828 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-12-07 18:17:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:16,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 18:17:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:16,853 INFO L225 Difference]: With dead ends: 10006 [2019-12-07 18:17:16,853 INFO L226 Difference]: Without dead ends: 10006 [2019-12-07 18:17:16,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-12-07 18:17:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-12-07 18:17:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-12-07 18:17:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-12-07 18:17:17,074 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-12-07 18:17:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:17,075 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-12-07 18:17:17,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-12-07 18:17:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:17:17,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:17,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:17,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-07 18:17:17,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:17,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932703700] [2019-12-07 18:17:17,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:17,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932703700] [2019-12-07 18:17:17,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:17,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:17,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946670660] [2019-12-07 18:17:17,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:17:17,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:17,113 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-12-07 18:17:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:17,240 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-12-07 18:17:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:17:17,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:17:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:17,263 INFO L225 Difference]: With dead ends: 10925 [2019-12-07 18:17:17,263 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 18:17:17,263 INFO L630 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 [2019-12-07 18:17:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 18:17:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-12-07 18:17:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-12-07 18:17:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-12-07 18:17:17,438 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-12-07 18:17:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:17,438 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-12-07 18:17:17,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:17:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-12-07 18:17:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:17:17,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:17,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:17,440 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-07 18:17:17,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:17,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933605755] [2019-12-07 18:17:17,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:17,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933605755] [2019-12-07 18:17:17,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:17,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:17,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043802427] [2019-12-07 18:17:17,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:17:17,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:17,472 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-12-07 18:17:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:17,594 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-12-07 18:17:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:17:17,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:17:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:17,610 INFO L225 Difference]: With dead ends: 11905 [2019-12-07 18:17:17,610 INFO L226 Difference]: Without dead ends: 11891 [2019-12-07 18:17:17,611 INFO L630 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 [2019-12-07 18:17:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-07 18:17:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-12-07 18:17:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-12-07 18:17:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-12-07 18:17:17,812 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-12-07 18:17:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:17,813 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-12-07 18:17:17,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:17:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-12-07 18:17:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:17:17,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:17,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:17,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-12-07 18:17:17,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:17,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205555035] [2019-12-07 18:17:17,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:17,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205555035] [2019-12-07 18:17:17,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:17,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:17:17,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181439866] [2019-12-07 18:17:17,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:17,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:17,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:17,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:17,866 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-12-07 18:17:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:17,917 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-12-07 18:17:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:17,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:17:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:17,938 INFO L225 Difference]: With dead ends: 16550 [2019-12-07 18:17:17,938 INFO L226 Difference]: Without dead ends: 15886 [2019-12-07 18:17:17,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-07 18:17:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-12-07 18:17:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-12-07 18:17:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-12-07 18:17:18,170 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-12-07 18:17:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:18,171 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-12-07 18:17:18,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-12-07 18:17:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:17:18,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:18,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:18,176 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-12-07 18:17:18,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:18,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199109321] [2019-12-07 18:17:18,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:18,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199109321] [2019-12-07 18:17:18,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:18,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:17:18,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670724912] [2019-12-07 18:17:18,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:18,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:18,210 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 3 states. [2019-12-07 18:17:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:18,251 INFO L93 Difference]: Finished difference Result 15168 states and 50237 transitions. [2019-12-07 18:17:18,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:18,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 18:17:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:18,269 INFO L225 Difference]: With dead ends: 15168 [2019-12-07 18:17:18,270 INFO L226 Difference]: Without dead ends: 15052 [2019-12-07 18:17:18,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2019-12-07 18:17:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15052. [2019-12-07 18:17:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15052 states. [2019-12-07 18:17:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 49867 transitions. [2019-12-07 18:17:18,516 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 49867 transitions. Word has length 17 [2019-12-07 18:17:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:18,516 INFO L462 AbstractCegarLoop]: Abstraction has 15052 states and 49867 transitions. [2019-12-07 18:17:18,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 49867 transitions. [2019-12-07 18:17:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:17:18,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:18,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:18,523 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:18,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1452760467, now seen corresponding path program 1 times [2019-12-07 18:17:18,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:18,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566598450] [2019-12-07 18:17:18,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:18,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566598450] [2019-12-07 18:17:18,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:18,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:18,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406001315] [2019-12-07 18:17:18,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:18,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:18,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:18,547 INFO L87 Difference]: Start difference. First operand 15052 states and 49867 transitions. Second operand 3 states. [2019-12-07 18:17:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:18,558 INFO L93 Difference]: Finished difference Result 2168 states and 5337 transitions. [2019-12-07 18:17:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:18,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:17:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:18,560 INFO L225 Difference]: With dead ends: 2168 [2019-12-07 18:17:18,560 INFO L226 Difference]: Without dead ends: 2168 [2019-12-07 18:17:18,560 INFO L630 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 [2019-12-07 18:17:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-07 18:17:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-07 18:17:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-07 18:17:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 5337 transitions. [2019-12-07 18:17:18,582 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 5337 transitions. Word has length 18 [2019-12-07 18:17:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:18,582 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 5337 transitions. [2019-12-07 18:17:18,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 5337 transitions. [2019-12-07 18:17:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:17:18,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:18,584 INFO L410 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] [2019-12-07 18:17:18,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-07 18:17:18,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:18,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274810953] [2019-12-07 18:17:18,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:18,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274810953] [2019-12-07 18:17:18,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012360974] [2019-12-07 18:17:18,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:17:18,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:18,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:17:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:17:18,633 INFO L87 Difference]: Start difference. First operand 2168 states and 5337 transitions. Second operand 5 states. [2019-12-07 18:17:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:18,775 INFO L93 Difference]: Finished difference Result 2757 states and 6648 transitions. [2019-12-07 18:17:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:17:18,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:17:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:18,778 INFO L225 Difference]: With dead ends: 2757 [2019-12-07 18:17:18,778 INFO L226 Difference]: Without dead ends: 2721 [2019-12-07 18:17:18,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:17:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-07 18:17:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2253. [2019-12-07 18:17:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-07 18:17:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5518 transitions. [2019-12-07 18:17:18,803 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5518 transitions. Word has length 26 [2019-12-07 18:17:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:18,803 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 5518 transitions. [2019-12-07 18:17:18,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:17:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5518 transitions. [2019-12-07 18:17:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:17:18,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:18,806 INFO L410 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] [2019-12-07 18:17:18,806 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-12-07 18:17:18,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:18,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107457496] [2019-12-07 18:17:18,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:18,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107457496] [2019-12-07 18:17:18,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:18,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:17:18,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591701198] [2019-12-07 18:17:18,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:17:18,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:17:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:17:18,875 INFO L87 Difference]: Start difference. First operand 2253 states and 5518 transitions. Second operand 5 states. [2019-12-07 18:17:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:19,023 INFO L93 Difference]: Finished difference Result 2518 states and 6098 transitions. [2019-12-07 18:17:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:17:19,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:17:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:19,025 INFO L225 Difference]: With dead ends: 2518 [2019-12-07 18:17:19,025 INFO L226 Difference]: Without dead ends: 2518 [2019-12-07 18:17:19,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:17:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-12-07 18:17:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2314. [2019-12-07 18:17:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2019-12-07 18:17:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 5632 transitions. [2019-12-07 18:17:19,046 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 5632 transitions. Word has length 27 [2019-12-07 18:17:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:19,046 INFO L462 AbstractCegarLoop]: Abstraction has 2314 states and 5632 transitions. [2019-12-07 18:17:19,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:17:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 5632 transitions. [2019-12-07 18:17:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:17:19,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:19,049 INFO L410 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] [2019-12-07 18:17:19,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-12-07 18:17:19,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:19,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210832528] [2019-12-07 18:17:19,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:19,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210832528] [2019-12-07 18:17:19,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:19,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:19,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116914271] [2019-12-07 18:17:19,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:17:19,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:17:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:17:19,091 INFO L87 Difference]: Start difference. First operand 2314 states and 5632 transitions. Second operand 5 states. [2019-12-07 18:17:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:19,201 INFO L93 Difference]: Finished difference Result 2702 states and 6515 transitions. [2019-12-07 18:17:19,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:17:19,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:17:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:19,203 INFO L225 Difference]: With dead ends: 2702 [2019-12-07 18:17:19,203 INFO L226 Difference]: Without dead ends: 2666 [2019-12-07 18:17:19,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:17:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-07 18:17:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2254. [2019-12-07 18:17:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-12-07 18:17:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 5516 transitions. [2019-12-07 18:17:19,224 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 5516 transitions. Word has length 27 [2019-12-07 18:17:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:19,225 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 5516 transitions. [2019-12-07 18:17:19,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:17:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 5516 transitions. [2019-12-07 18:17:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:17:19,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:19,227 INFO L410 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] [2019-12-07 18:17:19,227 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash -784111204, now seen corresponding path program 1 times [2019-12-07 18:17:19,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:19,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711039123] [2019-12-07 18:17:19,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:19,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711039123] [2019-12-07 18:17:19,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:19,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:17:19,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975677205] [2019-12-07 18:17:19,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:17:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:17:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:17:19,278 INFO L87 Difference]: Start difference. First operand 2254 states and 5516 transitions. Second operand 5 states. [2019-12-07 18:17:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:19,508 INFO L93 Difference]: Finished difference Result 3432 states and 8219 transitions. [2019-12-07 18:17:19,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:17:19,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:17:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:19,511 INFO L225 Difference]: With dead ends: 3432 [2019-12-07 18:17:19,511 INFO L226 Difference]: Without dead ends: 3432 [2019-12-07 18:17:19,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:17:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-12-07 18:17:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3013. [2019-12-07 18:17:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3013 states. [2019-12-07 18:17:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 7254 transitions. [2019-12-07 18:17:19,540 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 7254 transitions. Word has length 27 [2019-12-07 18:17:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:19,540 INFO L462 AbstractCegarLoop]: Abstraction has 3013 states and 7254 transitions. [2019-12-07 18:17:19,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:17:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 7254 transitions. [2019-12-07 18:17:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:17:19,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:19,543 INFO L410 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] [2019-12-07 18:17:19,543 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-12-07 18:17:19,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:19,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616898827] [2019-12-07 18:17:19,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:19,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616898827] [2019-12-07 18:17:19,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:19,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:19,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676078160] [2019-12-07 18:17:19,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:17:19,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:19,574 INFO L87 Difference]: Start difference. First operand 3013 states and 7254 transitions. Second operand 4 states. [2019-12-07 18:17:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:19,588 INFO L93 Difference]: Finished difference Result 1587 states and 3608 transitions. [2019-12-07 18:17:19,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:17:19,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:17:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:19,590 INFO L225 Difference]: With dead ends: 1587 [2019-12-07 18:17:19,590 INFO L226 Difference]: Without dead ends: 1587 [2019-12-07 18:17:19,590 INFO L630 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 [2019-12-07 18:17:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-07 18:17:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 927. [2019-12-07 18:17:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-07 18:17:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2077 transitions. [2019-12-07 18:17:19,600 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2077 transitions. Word has length 28 [2019-12-07 18:17:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:19,600 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2077 transitions. [2019-12-07 18:17:19,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:17:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2077 transitions. [2019-12-07 18:17:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:17:19,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:19,601 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 18:17:19,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-12-07 18:17:19,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:19,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726723967] [2019-12-07 18:17:19,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:19,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726723967] [2019-12-07 18:17:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:17:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13092787] [2019-12-07 18:17:19,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:17:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:17:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:17:19,654 INFO L87 Difference]: Start difference. First operand 927 states and 2077 transitions. Second operand 6 states. [2019-12-07 18:17:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:20,068 INFO L93 Difference]: Finished difference Result 1160 states and 2544 transitions. [2019-12-07 18:17:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:17:20,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 18:17:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:20,071 INFO L225 Difference]: With dead ends: 1160 [2019-12-07 18:17:20,071 INFO L226 Difference]: Without dead ends: 1160 [2019-12-07 18:17:20,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:17:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-12-07 18:17:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 941. [2019-12-07 18:17:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-07 18:17:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2105 transitions. [2019-12-07 18:17:20,091 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2105 transitions. Word has length 41 [2019-12-07 18:17:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:20,092 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 2105 transitions. [2019-12-07 18:17:20,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:17:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2105 transitions. [2019-12-07 18:17:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:17:20,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:20,094 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 18:17:20,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -231336031, now seen corresponding path program 2 times [2019-12-07 18:17:20,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:20,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108839992] [2019-12-07 18:17:20,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:20,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108839992] [2019-12-07 18:17:20,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:20,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:17:20,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34058356] [2019-12-07 18:17:20,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:17:20,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:17:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:17:20,162 INFO L87 Difference]: Start difference. First operand 941 states and 2105 transitions. Second operand 4 states. [2019-12-07 18:17:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:20,173 INFO L93 Difference]: Finished difference Result 1595 states and 3606 transitions. [2019-12-07 18:17:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:17:20,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 18:17:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:20,175 INFO L225 Difference]: With dead ends: 1595 [2019-12-07 18:17:20,175 INFO L226 Difference]: Without dead ends: 682 [2019-12-07 18:17:20,175 INFO L630 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 [2019-12-07 18:17:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-12-07 18:17:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-12-07 18:17:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-07 18:17:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1549 transitions. [2019-12-07 18:17:20,180 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1549 transitions. Word has length 41 [2019-12-07 18:17:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:20,180 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1549 transitions. [2019-12-07 18:17:20,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:17:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1549 transitions. [2019-12-07 18:17:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:17:20,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:20,182 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 18:17:20,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:20,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1632906437, now seen corresponding path program 3 times [2019-12-07 18:17:20,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:20,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687910527] [2019-12-07 18:17:20,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:20,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687910527] [2019-12-07 18:17:20,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:20,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:17:20,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855863514] [2019-12-07 18:17:20,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:17:20,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:20,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:17:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:17:20,288 INFO L87 Difference]: Start difference. First operand 682 states and 1549 transitions. Second operand 8 states. [2019-12-07 18:17:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:20,623 INFO L93 Difference]: Finished difference Result 920 states and 2066 transitions. [2019-12-07 18:17:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:17:20,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-07 18:17:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:20,624 INFO L225 Difference]: With dead ends: 920 [2019-12-07 18:17:20,624 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 18:17:20,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:17:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 18:17:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 727. [2019-12-07 18:17:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-07 18:17:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1663 transitions. [2019-12-07 18:17:20,630 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1663 transitions. Word has length 41 [2019-12-07 18:17:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:20,630 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1663 transitions. [2019-12-07 18:17:20,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:17:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1663 transitions. [2019-12-07 18:17:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:17:20,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:20,631 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 18:17:20,632 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash 341255245, now seen corresponding path program 4 times [2019-12-07 18:17:20,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:20,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769997519] [2019-12-07 18:17:20,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:20,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769997519] [2019-12-07 18:17:20,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:20,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:17:20,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136580302] [2019-12-07 18:17:20,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:17:20,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:17:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:17:20,695 INFO L87 Difference]: Start difference. First operand 727 states and 1663 transitions. Second operand 7 states. [2019-12-07 18:17:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:20,953 INFO L93 Difference]: Finished difference Result 969 states and 2067 transitions. [2019-12-07 18:17:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:17:20,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-07 18:17:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:20,955 INFO L225 Difference]: With dead ends: 969 [2019-12-07 18:17:20,955 INFO L226 Difference]: Without dead ends: 969 [2019-12-07 18:17:20,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:17:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-12-07 18:17:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 554. [2019-12-07 18:17:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-07 18:17:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1208 transitions. [2019-12-07 18:17:20,960 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1208 transitions. Word has length 41 [2019-12-07 18:17:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:20,961 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1208 transitions. [2019-12-07 18:17:20,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:17:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1208 transitions. [2019-12-07 18:17:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:17:20,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:20,962 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 18:17:20,962 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1531216379, now seen corresponding path program 5 times [2019-12-07 18:17:20,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:20,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983960248] [2019-12-07 18:17:20,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:20,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983960248] [2019-12-07 18:17:20,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:20,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:17:20,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681359252] [2019-12-07 18:17:20,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:17:20,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:17:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:20,992 INFO L87 Difference]: Start difference. First operand 554 states and 1208 transitions. Second operand 3 states. [2019-12-07 18:17:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:21,000 INFO L93 Difference]: Finished difference Result 552 states and 1203 transitions. [2019-12-07 18:17:21,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:17:21,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 18:17:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:21,001 INFO L225 Difference]: With dead ends: 552 [2019-12-07 18:17:21,001 INFO L226 Difference]: Without dead ends: 552 [2019-12-07 18:17:21,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:17:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-12-07 18:17:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 469. [2019-12-07 18:17:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-12-07 18:17:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1036 transitions. [2019-12-07 18:17:21,006 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1036 transitions. Word has length 41 [2019-12-07 18:17:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:21,006 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 1036 transitions. [2019-12-07 18:17:21,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:17:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1036 transitions. [2019-12-07 18:17:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:17:21,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:21,007 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:21,007 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1753934669, now seen corresponding path program 1 times [2019-12-07 18:17:21,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:21,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854930888] [2019-12-07 18:17:21,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:21,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854930888] [2019-12-07 18:17:21,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:17:21,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:17:21,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782806935] [2019-12-07 18:17:21,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:17:21,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:17:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:17:21,051 INFO L87 Difference]: Start difference. First operand 469 states and 1036 transitions. Second operand 6 states. [2019-12-07 18:17:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:21,130 INFO L93 Difference]: Finished difference Result 822 states and 1774 transitions. [2019-12-07 18:17:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:17:21,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 18:17:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:21,131 INFO L225 Difference]: With dead ends: 822 [2019-12-07 18:17:21,131 INFO L226 Difference]: Without dead ends: 499 [2019-12-07 18:17:21,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:17:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-12-07 18:17:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 455. [2019-12-07 18:17:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-12-07 18:17:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 973 transitions. [2019-12-07 18:17:21,135 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 973 transitions. Word has length 42 [2019-12-07 18:17:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:21,135 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 973 transitions. [2019-12-07 18:17:21,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:17:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 973 transitions. [2019-12-07 18:17:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:17:21,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:21,136 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:21,136 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 2 times [2019-12-07 18:17:21,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:21,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240180776] [2019-12-07 18:17:21,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:17:21,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:17:21,187 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:17:21,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_35| 1)) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1639~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_35|) |v_ULTIMATE.start_main_~#t1639~0.offset_24| 0)) |v_#memory_int_17|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1639~0.base_35| 4)) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1639~0.offset_24|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_35|)) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1639~0.base=|v_ULTIMATE.start_main_~#t1639~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_24|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_35|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1639~0.offset=|v_ULTIMATE.start_main_~#t1639~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1639~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1639~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:17:21,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10|) |v_ULTIMATE.start_main_~#t1640~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1640~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1640~0.base_10| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1640~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base] because there is no mapped edge [2019-12-07 18:17:21,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~__unbuffered_p1_EBX~0_Out1568342979 ~y~0_Out1568342979) (= ~x$r_buff1_thd2~0_Out1568342979 ~x$r_buff0_thd2~0_In1568342979) (= ~__unbuffered_p1_EAX~0_Out1568342979 ~y~0_Out1568342979) (= ~x$r_buff0_thd2~0_Out1568342979 1) (= 1 ~y~0_Out1568342979) (= ~x$r_buff1_thd0~0_Out1568342979 ~x$r_buff0_thd0~0_In1568342979) (= ~x$r_buff1_thd1~0_Out1568342979 ~x$r_buff0_thd1~0_In1568342979) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979 0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568342979, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568342979, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1568342979} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568342979, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568342979, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1568342979, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1568342979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1568342979, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1568342979, ~y~0=~y~0_Out1568342979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1568342979, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1568342979} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:17:21,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 18:17:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-35176347 256)))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd1~0_In-35176347 256))))) (and (or .cse0 (not (= 0 (mod ~x$w_buff1_used~0_In-35176347 256)))) (= |P0Thread1of1ForFork1_#t~ite23_Out-35176347| |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) .cse1 (= |P0Thread1of1ForFork1_#t~ite24_Out-35176347| |P0Thread1of1ForFork1_#t~ite23_Out-35176347|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) (or .cse0 (not (= (mod ~x$r_buff1_thd1~0_In-35176347 256) 0))) (not (= (mod ~x$w_buff0_used~0_In-35176347 256) 0)))) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out-35176347| ~x$r_buff1_thd1~0_In-35176347) (= |P0Thread1of1ForFork1_#t~ite22_In-35176347| |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) (= |P0Thread1of1ForFork1_#t~ite23_In-35176347| |P0Thread1of1ForFork1_#t~ite23_Out-35176347|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-35176347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-35176347, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-35176347, ~weak$$choice2~0=~weak$$choice2~0_In-35176347, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-35176347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-35176347, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-35176347|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-35176347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-35176347, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-35176347, ~weak$$choice2~0=~weak$$choice2~0_In-35176347, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-35176347|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-35176347|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-35176347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-35176347} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 18:17:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:17:21,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1403639059 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1403639059 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1403639059|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1403639059| ~x$w_buff0_used~0_In-1403639059)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1403639059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403639059} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1403639059, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1403639059|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403639059} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In142093506 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In142093506 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In142093506 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In142093506 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out142093506| ~x$w_buff1_used~0_In142093506)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out142093506| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In142093506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In142093506, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In142093506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142093506} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In142093506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In142093506, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In142093506, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out142093506|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142093506} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out1128825714 ~x$r_buff0_thd2~0_In1128825714)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1128825714 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1128825714 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~x$r_buff0_thd2~0_Out1128825714 0) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128825714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128825714} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1128825714|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1128825714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128825714} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In442631918 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In442631918 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In442631918 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In442631918 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out442631918| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out442631918| ~x$r_buff1_thd2~0_In442631918)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In442631918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In442631918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In442631918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442631918} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out442631918|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In442631918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In442631918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In442631918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442631918} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:17:21,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2135856585 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2135856585 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-2135856585 |ULTIMATE.start_main_#t~ite34_Out-2135856585|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-2135856585| ~x$w_buff1~0_In-2135856585)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2135856585, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135856585, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135856585, ~x~0=~x~0_In-2135856585} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2135856585, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135856585, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135856585, ~x~0=~x~0_In-2135856585, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2135856585|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:17:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:17:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1660722088 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1660722088 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1660722088| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1660722088| ~x$w_buff0_used~0_In-1660722088) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1660722088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660722088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1660722088, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1660722088|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660722088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:17:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In708009924 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In708009924 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In708009924 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In708009924 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out708009924| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite37_Out708009924| ~x$w_buff1_used~0_In708009924) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In708009924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708009924, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In708009924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708009924} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In708009924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708009924, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out708009924|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In708009924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708009924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:17:21,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In608089481 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In608089481 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out608089481| 0)) (and (= ~x$r_buff0_thd0~0_In608089481 |ULTIMATE.start_main_#t~ite38_Out608089481|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In608089481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In608089481} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In608089481, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out608089481|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In608089481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:17:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-884109349 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-884109349 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-884109349 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-884109349 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-884109349| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-884109349| ~x$r_buff1_thd0~0_In-884109349)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-884109349, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-884109349, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-884109349, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884109349} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-884109349, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-884109349|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-884109349, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-884109349, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884109349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:17:21,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:17:21,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:17:21 BasicIcfg [2019-12-07 18:17:21,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:17:21,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:17:21,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:17:21,235 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:17:21,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:17:12" (3/4) ... [2019-12-07 18:17:21,237 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:17:21,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_35| 1)) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1639~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1639~0.base_35|) |v_ULTIMATE.start_main_~#t1639~0.offset_24| 0)) |v_#memory_int_17|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1639~0.base_35| 4)) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1639~0.offset_24|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1639~0.base_35|)) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1639~0.base=|v_ULTIMATE.start_main_~#t1639~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_24|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_35|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1639~0.offset=|v_ULTIMATE.start_main_~#t1639~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1639~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1639~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:17:21,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1640~0.base_10|) |v_ULTIMATE.start_main_~#t1640~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1640~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1640~0.base_10| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1640~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1640~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1640~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1640~0.offset=|v_ULTIMATE.start_main_~#t1640~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1640~0.base=|v_ULTIMATE.start_main_~#t1640~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1640~0.offset, #length, ULTIMATE.start_main_~#t1640~0.base] because there is no mapped edge [2019-12-07 18:17:21,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~__unbuffered_p1_EBX~0_Out1568342979 ~y~0_Out1568342979) (= ~x$r_buff1_thd2~0_Out1568342979 ~x$r_buff0_thd2~0_In1568342979) (= ~__unbuffered_p1_EAX~0_Out1568342979 ~y~0_Out1568342979) (= ~x$r_buff0_thd2~0_Out1568342979 1) (= 1 ~y~0_Out1568342979) (= ~x$r_buff1_thd0~0_Out1568342979 ~x$r_buff0_thd0~0_In1568342979) (= ~x$r_buff1_thd1~0_Out1568342979 ~x$r_buff0_thd1~0_In1568342979) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979 0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568342979, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568342979, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1568342979} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1568342979, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568342979, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out1568342979, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In1568342979, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1568342979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1568342979, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1568342979, ~y~0=~y~0_Out1568342979, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1568342979, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1568342979} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:17:21,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 18:17:21,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-35176347 256)))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd1~0_In-35176347 256))))) (and (or .cse0 (not (= 0 (mod ~x$w_buff1_used~0_In-35176347 256)))) (= |P0Thread1of1ForFork1_#t~ite23_Out-35176347| |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) .cse1 (= |P0Thread1of1ForFork1_#t~ite24_Out-35176347| |P0Thread1of1ForFork1_#t~ite23_Out-35176347|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) (or .cse0 (not (= (mod ~x$r_buff1_thd1~0_In-35176347 256) 0))) (not (= (mod ~x$w_buff0_used~0_In-35176347 256) 0)))) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out-35176347| ~x$r_buff1_thd1~0_In-35176347) (= |P0Thread1of1ForFork1_#t~ite22_In-35176347| |P0Thread1of1ForFork1_#t~ite22_Out-35176347|) (= |P0Thread1of1ForFork1_#t~ite23_In-35176347| |P0Thread1of1ForFork1_#t~ite23_Out-35176347|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-35176347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-35176347, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-35176347, ~weak$$choice2~0=~weak$$choice2~0_In-35176347, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-35176347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-35176347, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-35176347|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-35176347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-35176347, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-35176347, ~weak$$choice2~0=~weak$$choice2~0_In-35176347, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-35176347|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-35176347|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-35176347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-35176347} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 18:17:21,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:17:21,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1403639059 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1403639059 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1403639059|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1403639059| ~x$w_buff0_used~0_In-1403639059)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1403639059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403639059} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1403639059, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1403639059|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403639059} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:17:21,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In142093506 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In142093506 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In142093506 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In142093506 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out142093506| ~x$w_buff1_used~0_In142093506)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out142093506| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In142093506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In142093506, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In142093506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142093506} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In142093506, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In142093506, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In142093506, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out142093506|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In142093506} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out1128825714 ~x$r_buff0_thd2~0_In1128825714)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1128825714 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1128825714 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~x$r_buff0_thd2~0_Out1128825714 0) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128825714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128825714} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1128825714|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1128825714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128825714} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In442631918 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In442631918 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In442631918 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In442631918 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out442631918| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out442631918| ~x$r_buff1_thd2~0_In442631918)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In442631918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In442631918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In442631918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442631918} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out442631918|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In442631918, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In442631918, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In442631918, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442631918} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2135856585 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2135856585 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-2135856585 |ULTIMATE.start_main_#t~ite34_Out-2135856585|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-2135856585| ~x$w_buff1~0_In-2135856585)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2135856585, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135856585, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135856585, ~x~0=~x~0_In-2135856585} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2135856585, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135856585, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2135856585, ~x~0=~x~0_In-2135856585, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2135856585|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:17:21,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1660722088 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1660722088 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1660722088| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1660722088| ~x$w_buff0_used~0_In-1660722088) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1660722088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660722088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1660722088, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1660722088|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1660722088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:17:21,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In708009924 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In708009924 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In708009924 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In708009924 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out708009924| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite37_Out708009924| ~x$w_buff1_used~0_In708009924) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In708009924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708009924, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In708009924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708009924} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In708009924, ~x$w_buff1_used~0=~x$w_buff1_used~0_In708009924, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out708009924|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In708009924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In708009924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:17:21,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In608089481 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In608089481 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out608089481| 0)) (and (= ~x$r_buff0_thd0~0_In608089481 |ULTIMATE.start_main_#t~ite38_Out608089481|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In608089481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In608089481} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In608089481, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out608089481|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In608089481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:17:21,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-884109349 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-884109349 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-884109349 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-884109349 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-884109349| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-884109349| ~x$r_buff1_thd0~0_In-884109349)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-884109349, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-884109349, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-884109349, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884109349} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-884109349, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-884109349|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-884109349, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-884109349, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884109349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:17:21,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:17:21,292 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bbb0054a-40bb-4b5d-aaf6-81ad78e41371/bin/uautomizer/witness.graphml [2019-12-07 18:17:21,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:17:21,293 INFO L168 Benchmark]: Toolchain (without parser) took 9594.62 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.8 MB). Free memory was 938.8 MB in the beginning and 1.0 GB in the end (delta: -99.9 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,293 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:17:21,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,294 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 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. [2019-12-07 18:17:21,295 INFO L168 Benchmark]: RCFGBuilder took 399.80 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,295 INFO L168 Benchmark]: TraceAbstraction took 8703.25 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 297.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,295 INFO L168 Benchmark]: Witness Printer took 56.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:17:21,297 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.96 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. * RCFGBuilder took 399.80 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8703.25 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 297.1 MB. Max. memory is 11.5 GB. * Witness Printer took 56.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1981 SDtfs, 1641 SDslu, 3228 SDs, 0 SdLazy, 2498 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 9425 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 67862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...