./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc.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_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/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 6d3f91f2fb21202bd509c4d1983bf3be51d6e246 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:25:45,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:25:45,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:25:45,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:25:45,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:25:45,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:25:45,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:25:45,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:25:45,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:25:45,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:25:45,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:25:45,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:25:45,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:25:45,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:25:45,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:25:45,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:25:45,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:25:45,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:25:45,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:25:45,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:25:45,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:25:45,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:25:45,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:25:45,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:25:45,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:25:45,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:25:45,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:25:45,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:25:45,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:25:45,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:25:45,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:25:45,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:25:45,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:25:45,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:25:45,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:25:45,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:25:45,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:25:45,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:25:45,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:25:45,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:25:45,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:25:45,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:25:45,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:25:45,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:25:45,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:25:45,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:25:45,726 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:25:45,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:25:45,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:25:45,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:25:45,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:25:45,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:25:45,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:25:45,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:25:45,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:25:45,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:25:45,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:25:45,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:25:45,729 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_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/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 -> 6d3f91f2fb21202bd509c4d1983bf3be51d6e246 [2019-12-07 17:25:45,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:25:45,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:25:45,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:25:45,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:25:45,843 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:25:45,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc.i [2019-12-07 17:25:45,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/data/eeae275af/dcc2c9aa7b0a41c8a671cae9dd2c0722/FLAGe62358d0a [2019-12-07 17:25:46,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:25:46,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/sv-benchmarks/c/pthread-wmm/safe033_power.oepc.i [2019-12-07 17:25:46,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/data/eeae275af/dcc2c9aa7b0a41c8a671cae9dd2c0722/FLAGe62358d0a [2019-12-07 17:25:46,682 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/data/eeae275af/dcc2c9aa7b0a41c8a671cae9dd2c0722 [2019-12-07 17:25:46,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:25:46,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:25:46,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:25:46,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:25:46,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:25:46,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:25:46" (1/1) ... [2019-12-07 17:25:46,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6336f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:46, skipping insertion in model container [2019-12-07 17:25:46,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:25:46" (1/1) ... [2019-12-07 17:25:46,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:25:46,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:25:46,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:25:46,985 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:25:47,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:25:47,071 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:25:47,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47 WrapperNode [2019-12-07 17:25:47,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:25:47,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:25:47,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:25:47,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:25:47,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:25:47,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:25:47,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:25:47,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:25:47,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... [2019-12-07 17:25:47,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:25:47,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:25:47,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:25:47,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:25:47,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/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 17:25:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:25:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:25:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:25:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:25:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:25:47,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:25:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:25:47,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:25:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:25:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:25:47,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:25:47,179 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 17:25:47,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:25:47,485 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:25:47,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:25:47 BoogieIcfgContainer [2019-12-07 17:25:47,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:25:47,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:25:47,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:25:47,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:25:47,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:25:46" (1/3) ... [2019-12-07 17:25:47,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31841668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:25:47, skipping insertion in model container [2019-12-07 17:25:47,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:47" (2/3) ... [2019-12-07 17:25:47,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31841668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:25:47, skipping insertion in model container [2019-12-07 17:25:47,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:25:47" (3/3) ... [2019-12-07 17:25:47,490 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-07 17:25:47,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:25:47,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:25:47,501 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:25:47,502 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:25:47,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:25:47,548 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:25:47,561 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:25:47,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:25:47,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:25:47,561 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:25:47,561 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:25:47,561 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:25:47,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:25:47,561 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:25:47,572 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-07 17:25:47,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 17:25:47,617 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 17:25:47,618 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:25:47,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 17:25:47,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 17:25:47,657 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 17:25:47,657 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:25:47,661 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 17:25:47,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 17:25:47,670 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:25:50,160 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 17:25:50,295 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-07 17:25:50,295 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 17:25:50,297 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-07 17:25:50,524 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-07 17:25:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-07 17:25:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:25:50,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:50,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:25:50,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-07 17:25:50,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:50,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085356671] [2019-12-07 17:25:50,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:50,688 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 17:25:50,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085356671] [2019-12-07 17:25:50,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:50,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:25:50,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442709334] [2019-12-07 17:25:50,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:50,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:50,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:50,704 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-07 17:25:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:50,879 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-07 17:25:50,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:50,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:25:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:50,929 INFO L225 Difference]: With dead ends: 6240 [2019-12-07 17:25:50,929 INFO L226 Difference]: Without dead ends: 5850 [2019-12-07 17:25:50,930 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 17:25:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-07 17:25:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-07 17:25:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-07 17:25:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-07 17:25:51,169 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-07 17:25:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:51,169 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-07 17:25:51,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-07 17:25:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:25:51,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:51,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:51,172 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-07 17:25:51,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:51,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645931102] [2019-12-07 17:25:51,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:51,257 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 17:25:51,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645931102] [2019-12-07 17:25:51,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:51,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:51,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707055966] [2019-12-07 17:25:51,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:51,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:51,259 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-12-07 17:25:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:51,520 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-12-07 17:25:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:25:51,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:25:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:51,583 INFO L225 Difference]: With dead ends: 9088 [2019-12-07 17:25:51,583 INFO L226 Difference]: Without dead ends: 9073 [2019-12-07 17:25:51,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:25:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-12-07 17:25:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-12-07 17:25:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-12-07 17:25:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-12-07 17:25:51,793 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-12-07 17:25:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:51,793 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-12-07 17:25:51,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:25:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-12-07 17:25:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:25:51,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:51,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:51,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-07 17:25:51,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:51,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519949565] [2019-12-07 17:25:51,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:51,838 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 17:25:51,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519949565] [2019-12-07 17:25:51,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:51,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:25:51,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943697364] [2019-12-07 17:25:51,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:51,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:51,840 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-12-07 17:25:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:51,948 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-12-07 17:25:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:51,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:25:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:51,973 INFO L225 Difference]: With dead ends: 10304 [2019-12-07 17:25:51,973 INFO L226 Difference]: Without dead ends: 10304 [2019-12-07 17:25:51,973 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 17:25:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-12-07 17:25:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-12-07 17:25:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-12-07 17:25:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-12-07 17:25:52,180 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-12-07 17:25:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:52,180 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-12-07 17:25:52,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-12-07 17:25:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:25:52,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:52,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:52,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-07 17:25:52,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:52,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412131039] [2019-12-07 17:25:52,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,224 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 17:25:52,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412131039] [2019-12-07 17:25:52,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:52,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:52,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517795823] [2019-12-07 17:25:52,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:52,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:52,225 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-12-07 17:25:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:52,344 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-12-07 17:25:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:25:52,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:25:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:52,366 INFO L225 Difference]: With dead ends: 10707 [2019-12-07 17:25:52,366 INFO L226 Difference]: Without dead ends: 10697 [2019-12-07 17:25:52,367 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 17:25:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-12-07 17:25:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-12-07 17:25:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-07 17:25:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-12-07 17:25:52,540 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-12-07 17:25:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:52,540 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-12-07 17:25:52,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:25:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-12-07 17:25:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:25:52,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:52,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:52,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-07 17:25:52,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:52,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66784441] [2019-12-07 17:25:52,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,582 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 17:25:52,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66784441] [2019-12-07 17:25:52,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:52,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:52,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266728887] [2019-12-07 17:25:52,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:52,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:52,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:52,583 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-12-07 17:25:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:52,708 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-12-07 17:25:52,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:25:52,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:25:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:52,724 INFO L225 Difference]: With dead ends: 11850 [2019-12-07 17:25:52,724 INFO L226 Difference]: Without dead ends: 11835 [2019-12-07 17:25:52,725 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 17:25:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-12-07 17:25:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-12-07 17:25:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-12-07 17:25:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-12-07 17:25:52,954 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-12-07 17:25:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:52,954 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-12-07 17:25:52,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:25:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-12-07 17:25:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:25:52,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:52,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:52,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-12-07 17:25:52,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:52,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56294014] [2019-12-07 17:25:52,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,008 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 17:25:53,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56294014] [2019-12-07 17:25:53,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:25:53,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731370155] [2019-12-07 17:25:53,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:53,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:53,010 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-12-07 17:25:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:53,065 INFO L93 Difference]: Finished difference Result 16633 states and 53921 transitions. [2019-12-07 17:25:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:53,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:25:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,086 INFO L225 Difference]: With dead ends: 16633 [2019-12-07 17:25:53,087 INFO L226 Difference]: Without dead ends: 15969 [2019-12-07 17:25:53,087 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 17:25:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15969 states. [2019-12-07 17:25:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15969 to 15370. [2019-12-07 17:25:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15370 states. [2019-12-07 17:25:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15370 states to 15370 states and 50457 transitions. [2019-12-07 17:25:53,358 INFO L78 Accepts]: Start accepts. Automaton has 15370 states and 50457 transitions. Word has length 16 [2019-12-07 17:25:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:53,358 INFO L462 AbstractCegarLoop]: Abstraction has 15370 states and 50457 transitions. [2019-12-07 17:25:53,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15370 states and 50457 transitions. [2019-12-07 17:25:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:25:53,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:53,364 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 17:25:53,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 101415142, now seen corresponding path program 1 times [2019-12-07 17:25:53,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:53,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458226358] [2019-12-07 17:25:53,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,409 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 17:25:53,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458226358] [2019-12-07 17:25:53,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:53,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180053496] [2019-12-07 17:25:53,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:53,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:53,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:53,411 INFO L87 Difference]: Start difference. First operand 15370 states and 50457 transitions. Second operand 3 states. [2019-12-07 17:25:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:53,457 INFO L93 Difference]: Finished difference Result 15370 states and 49641 transitions. [2019-12-07 17:25:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:53,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:25:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,476 INFO L225 Difference]: With dead ends: 15370 [2019-12-07 17:25:53,476 INFO L226 Difference]: Without dead ends: 15370 [2019-12-07 17:25:53,477 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 17:25:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15370 states. [2019-12-07 17:25:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15370 to 15120. [2019-12-07 17:25:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15120 states. [2019-12-07 17:25:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15120 states to 15120 states and 48921 transitions. [2019-12-07 17:25:53,735 INFO L78 Accepts]: Start accepts. Automaton has 15120 states and 48921 transitions. Word has length 17 [2019-12-07 17:25:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:53,735 INFO L462 AbstractCegarLoop]: Abstraction has 15120 states and 48921 transitions. [2019-12-07 17:25:53,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15120 states and 48921 transitions. [2019-12-07 17:25:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:25:53,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:53,739 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 17:25:53,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1351003813, now seen corresponding path program 1 times [2019-12-07 17:25:53,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:53,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601633898] [2019-12-07 17:25:53,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,758 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 17:25:53,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601633898] [2019-12-07 17:25:53,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:53,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299696204] [2019-12-07 17:25:53,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:53,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:53,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:53,760 INFO L87 Difference]: Start difference. First operand 15120 states and 48921 transitions. Second operand 3 states. [2019-12-07 17:25:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:53,769 INFO L93 Difference]: Finished difference Result 2101 states and 5025 transitions. [2019-12-07 17:25:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:53,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:25:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,771 INFO L225 Difference]: With dead ends: 2101 [2019-12-07 17:25:53,771 INFO L226 Difference]: Without dead ends: 2101 [2019-12-07 17:25:53,771 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 17:25:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-12-07 17:25:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-12-07 17:25:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-07 17:25:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 5025 transitions. [2019-12-07 17:25:53,790 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 5025 transitions. Word has length 17 [2019-12-07 17:25:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:53,790 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 5025 transitions. [2019-12-07 17:25:53,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 5025 transitions. [2019-12-07 17:25:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:25:53,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:53,792 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 17:25:53,792 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-07 17:25:53,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:53,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429334925] [2019-12-07 17:25:53,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,823 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 17:25:53,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429334925] [2019-12-07 17:25:53,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:25:53,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544938132] [2019-12-07 17:25:53,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:53,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:53,824 INFO L87 Difference]: Start difference. First operand 2101 states and 5025 transitions. Second operand 4 states. [2019-12-07 17:25:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:53,836 INFO L93 Difference]: Finished difference Result 993 states and 2318 transitions. [2019-12-07 17:25:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:25:53,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 17:25:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,837 INFO L225 Difference]: With dead ends: 993 [2019-12-07 17:25:53,837 INFO L226 Difference]: Without dead ends: 977 [2019-12-07 17:25:53,837 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 17:25:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-12-07 17:25:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 629. [2019-12-07 17:25:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-12-07 17:25:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1439 transitions. [2019-12-07 17:25:53,844 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1439 transitions. Word has length 26 [2019-12-07 17:25:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:53,844 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 1439 transitions. [2019-12-07 17:25:53,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:25:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1439 transitions. [2019-12-07 17:25:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:25:53,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:53,846 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 17:25:53,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 1 times [2019-12-07 17:25:53,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:53,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510444266] [2019-12-07 17:25:53,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,886 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 17:25:53,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510444266] [2019-12-07 17:25:53,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:53,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127213355] [2019-12-07 17:25:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:53,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:53,887 INFO L87 Difference]: Start difference. First operand 629 states and 1439 transitions. Second operand 3 states. [2019-12-07 17:25:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:53,893 INFO L93 Difference]: Finished difference Result 1047 states and 2408 transitions. [2019-12-07 17:25:53,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:53,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 17:25:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,894 INFO L225 Difference]: With dead ends: 1047 [2019-12-07 17:25:53,894 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 17:25:53,895 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 17:25:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 17:25:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-07 17:25:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 17:25:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1002 transitions. [2019-12-07 17:25:53,899 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1002 transitions. Word has length 42 [2019-12-07 17:25:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:53,899 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1002 transitions. [2019-12-07 17:25:53,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1002 transitions. [2019-12-07 17:25:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:25:53,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:53,900 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 17:25:53,900 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 2 times [2019-12-07 17:25:53,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:53,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118158759] [2019-12-07 17:25:53,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:53,962 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 17:25:53,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118158759] [2019-12-07 17:25:53,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:53,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:25:53,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155737966] [2019-12-07 17:25:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:25:53,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:25:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:25:53,964 INFO L87 Difference]: Start difference. First operand 438 states and 1002 transitions. Second operand 6 states. [2019-12-07 17:25:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:54,064 INFO L93 Difference]: Finished difference Result 797 states and 1776 transitions. [2019-12-07 17:25:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:25:54,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 17:25:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:54,065 INFO L225 Difference]: With dead ends: 797 [2019-12-07 17:25:54,065 INFO L226 Difference]: Without dead ends: 535 [2019-12-07 17:25:54,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:25:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-07 17:25:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-07 17:25:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-07 17:25:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1032 transitions. [2019-12-07 17:25:54,069 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1032 transitions. Word has length 42 [2019-12-07 17:25:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:54,069 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1032 transitions. [2019-12-07 17:25:54,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:25:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1032 transitions. [2019-12-07 17:25:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:25:54,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:54,070 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 17:25:54,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 3 times [2019-12-07 17:25:54,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:54,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087945903] [2019-12-07 17:25:54,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:25:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:25:54,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:25:54,161 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:25:54,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24| 1)) (= v_~y~0_90 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0)) |v_#memory_int_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2561~0.base_24| 4)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_25|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2561~0.offset=|v_ULTIMATE.start_main_~#t2561~0.offset_18|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2561~0.base=|v_ULTIMATE.start_main_~#t2561~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ~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, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2561~0.offset, #length, ~y~0, ~x$r_buff0_thd0~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, ULTIMATE.start_main_~#t2561~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:25:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2562~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2562~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2562~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11|) |v_ULTIMATE.start_main_~#t2562~0.offset_9| 1)) |v_#memory_int_5|) (= 0 |v_ULTIMATE.start_main_~#t2562~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_11|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:25:54,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~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 17:25:54,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1933714065 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1933714065| ~x$w_buff0~0_In-1933714065) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-1933714065| |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite9_Out-1933714065| |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1933714065 256)))) (or (= (mod ~x$w_buff0_used~0_In-1933714065 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1933714065 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1933714065 256))))) (= ~x$w_buff0~0_In-1933714065 |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1933714065, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933714065, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1933714065|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933714065, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933714065, ~weak$$choice2~0=~weak$$choice2~0_In-1933714065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933714065} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1933714065, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933714065, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1933714065|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1933714065|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933714065, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933714065, ~weak$$choice2~0=~weak$$choice2~0_In-1933714065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933714065} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 17:25:54,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} 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 17:25:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:25:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-93526780 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-93526780 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-93526780| ~x$w_buff0_used~0_In-93526780)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-93526780| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-93526780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93526780} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-93526780, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-93526780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93526780} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:25:54,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-153601423 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-153601423 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-153601423 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-153601423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-153601423|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-153601423| ~x$w_buff1_used~0_In-153601423) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-153601423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-153601423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-153601423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153601423} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-153601423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-153601423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-153601423, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-153601423|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153601423} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In903454110 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In903454110 ~x$r_buff0_thd2~0_Out903454110)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In903454110 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out903454110)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In903454110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903454110} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out903454110|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out903454110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903454110} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2075386580 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In2075386580 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2075386580 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2075386580 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out2075386580| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out2075386580| ~x$r_buff1_thd2~0_In2075386580)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2075386580, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2075386580, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2075386580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075386580} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2075386580|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2075386580, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2075386580, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2075386580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075386580} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In676491974 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In676491974 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out676491974| |ULTIMATE.start_main_#t~ite34_Out676491974|))) (or (and (not .cse0) (= ~x$w_buff1~0_In676491974 |ULTIMATE.start_main_#t~ite34_Out676491974|) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite34_Out676491974| ~x~0_In676491974) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In676491974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676491974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676491974, ~x~0=~x~0_In676491974} OutVars{~x$w_buff1~0=~x$w_buff1~0_In676491974, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out676491974|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676491974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676491974, ~x~0=~x~0_In676491974, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out676491974|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:25:54,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1482753371 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1482753371 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1482753371| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1482753371| ~x$w_buff0_used~0_In-1482753371)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1482753371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1482753371} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1482753371, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1482753371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1482753371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:25:54,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-2081573593 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2081573593 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2081573593 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2081573593 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-2081573593| ~x$w_buff1_used~0_In-2081573593) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2081573593|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2081573593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081573593, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2081573593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081573593} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2081573593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081573593, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2081573593|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2081573593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081573593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 17:25:54,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1030739626 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1030739626 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1030739626| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1030739626 |ULTIMATE.start_main_#t~ite38_Out1030739626|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1030739626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030739626} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1030739626, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1030739626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030739626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:25:54,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1203694654 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1203694654 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1203694654 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1203694654 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1203694654| ~x$r_buff1_thd0~0_In1203694654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1203694654| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203694654, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1203694654, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1203694654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203694654} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203694654, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1203694654|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1203694654, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1203694654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203694654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:25:54,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} 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 17:25:54,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:25:54 BasicIcfg [2019-12-07 17:25:54,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:25:54,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:25:54,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:25:54,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:25:54,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:25:47" (3/4) ... [2019-12-07 17:25:54,211 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:25:54,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24| 1)) (= v_~y~0_90 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_24|) |v_ULTIMATE.start_main_~#t2561~0.offset_18| 0)) |v_#memory_int_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_24|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2561~0.base_24| 4)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_25|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2561~0.offset=|v_ULTIMATE.start_main_~#t2561~0.offset_18|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2561~0.base=|v_ULTIMATE.start_main_~#t2561~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ~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, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2561~0.offset, #length, ~y~0, ~x$r_buff0_thd0~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, ULTIMATE.start_main_~#t2561~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:25:54,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2562~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2562~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2562~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11|) |v_ULTIMATE.start_main_~#t2562~0.offset_9| 1)) |v_#memory_int_5|) (= 0 |v_ULTIMATE.start_main_~#t2562~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_11|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:25:54,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~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 17:25:54,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1933714065 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1933714065| ~x$w_buff0~0_In-1933714065) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-1933714065| |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite9_Out-1933714065| |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1933714065 256)))) (or (= (mod ~x$w_buff0_used~0_In-1933714065 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1933714065 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1933714065 256))))) (= ~x$w_buff0~0_In-1933714065 |P0Thread1of1ForFork1_#t~ite8_Out-1933714065|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1933714065, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933714065, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1933714065|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933714065, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933714065, ~weak$$choice2~0=~weak$$choice2~0_In-1933714065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933714065} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1933714065, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933714065, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1933714065|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1933714065|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933714065, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933714065, ~weak$$choice2~0=~weak$$choice2~0_In-1933714065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933714065} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 17:25:54,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} 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 17:25:54,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-93526780 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-93526780 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-93526780| ~x$w_buff0_used~0_In-93526780)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-93526780| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-93526780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93526780} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-93526780, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-93526780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-93526780} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-153601423 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-153601423 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-153601423 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-153601423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-153601423|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-153601423| ~x$w_buff1_used~0_In-153601423) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-153601423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-153601423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-153601423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153601423} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-153601423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-153601423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-153601423, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-153601423|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153601423} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In903454110 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In903454110 ~x$r_buff0_thd2~0_Out903454110)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In903454110 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out903454110)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In903454110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903454110} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out903454110|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out903454110, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903454110} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In2075386580 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In2075386580 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2075386580 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2075386580 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out2075386580| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out2075386580| ~x$r_buff1_thd2~0_In2075386580)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2075386580, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2075386580, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2075386580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075386580} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2075386580|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2075386580, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2075386580, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2075386580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2075386580} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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 17:25:54,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:25:54,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In676491974 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In676491974 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out676491974| |ULTIMATE.start_main_#t~ite34_Out676491974|))) (or (and (not .cse0) (= ~x$w_buff1~0_In676491974 |ULTIMATE.start_main_#t~ite34_Out676491974|) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite34_Out676491974| ~x~0_In676491974) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In676491974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676491974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676491974, ~x~0=~x~0_In676491974} OutVars{~x$w_buff1~0=~x$w_buff1~0_In676491974, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out676491974|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In676491974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In676491974, ~x~0=~x~0_In676491974, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out676491974|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:25:54,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1482753371 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1482753371 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1482753371| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1482753371| ~x$w_buff0_used~0_In-1482753371)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1482753371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1482753371} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1482753371, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1482753371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1482753371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:25:54,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-2081573593 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2081573593 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2081573593 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2081573593 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-2081573593| ~x$w_buff1_used~0_In-2081573593) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-2081573593|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2081573593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081573593, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2081573593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081573593} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2081573593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081573593, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2081573593|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2081573593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081573593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 17:25:54,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1030739626 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1030739626 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1030739626| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1030739626 |ULTIMATE.start_main_#t~ite38_Out1030739626|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1030739626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030739626} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1030739626, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1030739626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030739626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:25:54,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1203694654 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1203694654 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1203694654 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1203694654 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1203694654| ~x$r_buff1_thd0~0_In1203694654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1203694654| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203694654, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1203694654, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1203694654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203694654} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1203694654, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1203694654|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1203694654, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1203694654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1203694654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:25:54,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} 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 17:25:54,264 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2a0e7ba3-b858-42fb-81e0-6efd319adeb2/bin/uautomizer/witness.graphml [2019-12-07 17:25:54,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:25:54,265 INFO L168 Benchmark]: Toolchain (without parser) took 7576.48 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 522.7 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 327.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:25:54,266 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:25:54,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -125.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:25:54,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.04 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 17:25:54,266 INFO L168 Benchmark]: Boogie Preprocessor took 24.31 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 17:25:54,267 INFO L168 Benchmark]: RCFGBuilder took 349.56 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:25:54,267 INFO L168 Benchmark]: TraceAbstraction took 6722.31 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 431.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:25:54,267 INFO L168 Benchmark]: Witness Printer took 55.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:25:54,269 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -125.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.04 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 24.31 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 349.56 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: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6722.31 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 431.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L792] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L732] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L732] 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) [L767] 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 [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L733] 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)) [L734] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L734] 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)) [L735] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L735] 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)) [L736] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L736] 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)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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$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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, 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] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1117 SDtfs, 831 SDslu, 1270 SDs, 0 SdLazy, 523 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15370occurred 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, 11 MinimizatonAttempts, 7175 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 20243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...