./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/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 fe6c6829814f0f98d8e397eaf5ef61f86453ef64 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 14:01:00,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:01:00,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:01:00,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:01:00,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:01:00,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:01:00,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:01:00,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:01:00,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:01:00,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:01:00,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:01:00,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:01:00,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:01:00,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:01:00,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:01:00,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:01:00,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:01:00,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:01:00,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:01:00,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:01:00,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:01:00,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:01:00,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:01:00,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:01:00,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:01:00,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:01:00,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:01:00,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:01:00,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:01:00,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:01:00,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:01:00,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:01:00,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:01:00,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:01:00,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:01:00,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:01:00,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:01:00,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:01:00,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:01:00,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:01:00,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:01:00,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:01:00,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:01:00,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:01:00,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:01:00,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:01:00,191 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:01:00,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:01:00,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:01:00,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:01:00,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:01:00,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:01:00,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:01:00,194 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_8dfa074a-28a6-46d0-9275-69e5d881514c/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 -> fe6c6829814f0f98d8e397eaf5ef61f86453ef64 [2019-12-07 14:01:00,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:01:00,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:01:00,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:01:00,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:01:00,308 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:01:00,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i [2019-12-07 14:01:00,351 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/data/49b76ffa8/010ab7c719cd4e4e89d10deb3b6d9a2a/FLAG635df6df8 [2019-12-07 14:01:00,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:01:00,799 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt.i [2019-12-07 14:01:00,810 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/data/49b76ffa8/010ab7c719cd4e4e89d10deb3b6d9a2a/FLAG635df6df8 [2019-12-07 14:01:01,138 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/data/49b76ffa8/010ab7c719cd4e4e89d10deb3b6d9a2a [2019-12-07 14:01:01,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:01:01,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:01:01,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:01:01,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:01:01,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:01:01,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01, skipping insertion in model container [2019-12-07 14:01:01,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:01:01,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:01:01,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:01:01,454 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:01:01,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:01:01,538 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:01:01,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01 WrapperNode [2019-12-07 14:01:01,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:01:01,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:01:01,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:01:01,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:01:01,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:01:01,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:01:01,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:01:01,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:01:01,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... [2019-12-07 14:01:01,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:01:01,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:01:01,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:01:01,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:01:01,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/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 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:01:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:01:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:01:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:01:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:01:01,643 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 14:01:01,954 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:01:01,954 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:01:01,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:01:01 BoogieIcfgContainer [2019-12-07 14:01:01,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:01:01,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:01:01,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:01:01,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:01:01,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:01:01" (1/3) ... [2019-12-07 14:01:01,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f91e664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:01:01, skipping insertion in model container [2019-12-07 14:01:01,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:01:01" (2/3) ... [2019-12-07 14:01:01,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f91e664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:01:01, skipping insertion in model container [2019-12-07 14:01:01,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:01:01" (3/3) ... [2019-12-07 14:01:01,959 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt.i [2019-12-07 14:01:01,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:01:01,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:01:01,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:01:01,970 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:01,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:01:02,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:01:02,029 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:01:02,029 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:01:02,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:01:02,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:01:02,030 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:01:02,030 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:01:02,030 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:01:02,030 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:01:02,040 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-07 14:01:02,041 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 14:01:02,085 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 14:01:02,085 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:01:02,093 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:01:02,103 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 14:01:02,124 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 14:01:02,124 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:01:02,127 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:01:02,136 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 14:01:02,137 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:01:04,716 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 14:01:04,817 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-07 14:01:04,817 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-07 14:01:04,819 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 14:01:05,062 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-07 14:01:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-07 14:01:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:01:05,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:05,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:01:05,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-07 14:01:05,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:05,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21613461] [2019-12-07 14:01:05,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:05,225 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 14:01:05,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21613461] [2019-12-07 14:01:05,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:05,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:01:05,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481673886] [2019-12-07 14:01:05,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:01:05,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:05,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:01:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:01:05,246 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-07 14:01:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:05,441 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-07 14:01:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:01:05,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:01:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:05,494 INFO L225 Difference]: With dead ends: 6636 [2019-12-07 14:01:05,494 INFO L226 Difference]: Without dead ends: 6246 [2019-12-07 14:01:05,495 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 14:01:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-07 14:01:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-07 14:01:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-07 14:01:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-07 14:01:05,726 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-07 14:01:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:05,726 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-07 14:01:05,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:01:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-07 14:01:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:01:05,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:05,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:05,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-07 14:01:05,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:05,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650661962] [2019-12-07 14:01:05,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:05,804 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 14:01:05,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650661962] [2019-12-07 14:01:05,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:05,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:01:05,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650456106] [2019-12-07 14:01:05,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:01:05,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:01:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:01:05,807 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-07 14:01:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:05,851 INFO L93 Difference]: Finished difference Result 1666 states and 4431 transitions. [2019-12-07 14:01:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:01:05,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:01:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:05,857 INFO L225 Difference]: With dead ends: 1666 [2019-12-07 14:01:05,857 INFO L226 Difference]: Without dead ends: 1276 [2019-12-07 14:01:05,858 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 14:01:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-07 14:01:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-07 14:01:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-07 14:01:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3147 transitions. [2019-12-07 14:01:05,882 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3147 transitions. Word has length 11 [2019-12-07 14:01:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:05,882 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3147 transitions. [2019-12-07 14:01:05,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:01:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3147 transitions. [2019-12-07 14:01:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:01:05,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:05,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:05,883 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-07 14:01:05,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:05,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878726629] [2019-12-07 14:01:05,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:05,917 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 14:01:05,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878726629] [2019-12-07 14:01:05,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:05,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:01:05,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125830650] [2019-12-07 14:01:05,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:01:05,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:01:05,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:01:05,918 INFO L87 Difference]: Start difference. First operand 1276 states and 3147 transitions. Second operand 3 states. [2019-12-07 14:01:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:05,967 INFO L93 Difference]: Finished difference Result 1986 states and 4934 transitions. [2019-12-07 14:01:05,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:01:05,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:01:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:05,976 INFO L225 Difference]: With dead ends: 1986 [2019-12-07 14:01:05,976 INFO L226 Difference]: Without dead ends: 1986 [2019-12-07 14:01:05,977 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 14:01:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-12-07 14:01:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1490. [2019-12-07 14:01:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-12-07 14:01:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 3702 transitions. [2019-12-07 14:01:06,006 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 3702 transitions. Word has length 14 [2019-12-07 14:01:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:06,007 INFO L462 AbstractCegarLoop]: Abstraction has 1490 states and 3702 transitions. [2019-12-07 14:01:06,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:01:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 3702 transitions. [2019-12-07 14:01:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:01:06,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:06,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:06,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-07 14:01:06,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:06,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564808722] [2019-12-07 14:01:06,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:06,057 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 14:01:06,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564808722] [2019-12-07 14:01:06,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:06,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:01:06,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934333715] [2019-12-07 14:01:06,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:01:06,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:01:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:01:06,059 INFO L87 Difference]: Start difference. First operand 1490 states and 3702 transitions. Second operand 4 states. [2019-12-07 14:01:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:06,184 INFO L93 Difference]: Finished difference Result 1934 states and 4662 transitions. [2019-12-07 14:01:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:01:06,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:01:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:06,196 INFO L225 Difference]: With dead ends: 1934 [2019-12-07 14:01:06,196 INFO L226 Difference]: Without dead ends: 1919 [2019-12-07 14:01:06,196 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 14:01:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-07 14:01:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1755. [2019-12-07 14:01:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-07 14:01:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 4270 transitions. [2019-12-07 14:01:06,230 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 4270 transitions. Word has length 14 [2019-12-07 14:01:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:06,231 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 4270 transitions. [2019-12-07 14:01:06,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:01:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 4270 transitions. [2019-12-07 14:01:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:01:06,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:06,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:06,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-07 14:01:06,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:06,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88348383] [2019-12-07 14:01:06,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:06,280 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 14:01:06,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88348383] [2019-12-07 14:01:06,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:06,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:01:06,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937356849] [2019-12-07 14:01:06,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:01:06,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:06,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:01:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:01:06,281 INFO L87 Difference]: Start difference. First operand 1755 states and 4270 transitions. Second operand 4 states. [2019-12-07 14:01:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:06,390 INFO L93 Difference]: Finished difference Result 2157 states and 5151 transitions. [2019-12-07 14:01:06,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:01:06,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:01:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:06,400 INFO L225 Difference]: With dead ends: 2157 [2019-12-07 14:01:06,400 INFO L226 Difference]: Without dead ends: 2136 [2019-12-07 14:01:06,401 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 14:01:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-12-07 14:01:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1779. [2019-12-07 14:01:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-07 14:01:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4301 transitions. [2019-12-07 14:01:06,429 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4301 transitions. Word has length 14 [2019-12-07 14:01:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:06,429 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4301 transitions. [2019-12-07 14:01:06,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:01:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4301 transitions. [2019-12-07 14:01:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:01:06,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:06,431 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 14:01:06,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-07 14:01:06,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:06,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988004307] [2019-12-07 14:01:06,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:06,495 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 14:01:06,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988004307] [2019-12-07 14:01:06,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:06,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:01:06,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225165880] [2019-12-07 14:01:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:01:06,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:01:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:01:06,497 INFO L87 Difference]: Start difference. First operand 1779 states and 4301 transitions. Second operand 5 states. [2019-12-07 14:01:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:06,528 INFO L93 Difference]: Finished difference Result 923 states and 2095 transitions. [2019-12-07 14:01:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:01:06,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:01:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:06,532 INFO L225 Difference]: With dead ends: 923 [2019-12-07 14:01:06,532 INFO L226 Difference]: Without dead ends: 819 [2019-12-07 14:01:06,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:01:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-07 14:01:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 774. [2019-12-07 14:01:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-07 14:01:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1752 transitions. [2019-12-07 14:01:06,543 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1752 transitions. Word has length 26 [2019-12-07 14:01:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:06,543 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1752 transitions. [2019-12-07 14:01:06,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:01:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1752 transitions. [2019-12-07 14:01:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:01:06,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:06,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:06,545 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-07 14:01:06,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:06,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376899749] [2019-12-07 14:01:06,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:06,612 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 14:01:06,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376899749] [2019-12-07 14:01:06,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:06,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:01:06,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609979434] [2019-12-07 14:01:06,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:01:06,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:01:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:01:06,614 INFO L87 Difference]: Start difference. First operand 774 states and 1752 transitions. Second operand 6 states. [2019-12-07 14:01:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:06,898 INFO L93 Difference]: Finished difference Result 1275 states and 2784 transitions. [2019-12-07 14:01:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:01:06,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 14:01:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:06,906 INFO L225 Difference]: With dead ends: 1275 [2019-12-07 14:01:06,906 INFO L226 Difference]: Without dead ends: 1275 [2019-12-07 14:01:06,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:01:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-07 14:01:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1021. [2019-12-07 14:01:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-12-07 14:01:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2284 transitions. [2019-12-07 14:01:06,926 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2284 transitions. Word has length 41 [2019-12-07 14:01:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:06,927 INFO L462 AbstractCegarLoop]: Abstraction has 1021 states and 2284 transitions. [2019-12-07 14:01:06,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:01:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2284 transitions. [2019-12-07 14:01:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:01:06,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:06,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:01:06,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash 166240103, now seen corresponding path program 2 times [2019-12-07 14:01:06,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:06,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324109753] [2019-12-07 14:01:06,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:07,009 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 14:01:07,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324109753] [2019-12-07 14:01:07,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:07,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:01:07,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712422258] [2019-12-07 14:01:07,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:01:07,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:01:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:01:07,011 INFO L87 Difference]: Start difference. First operand 1021 states and 2284 transitions. Second operand 3 states. [2019-12-07 14:01:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:07,021 INFO L93 Difference]: Finished difference Result 1019 states and 2279 transitions. [2019-12-07 14:01:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:01:07,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 14:01:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:07,027 INFO L225 Difference]: With dead ends: 1019 [2019-12-07 14:01:07,027 INFO L226 Difference]: Without dead ends: 1019 [2019-12-07 14:01:07,027 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 14:01:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-07 14:01:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 895. [2019-12-07 14:01:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 14:01:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2029 transitions. [2019-12-07 14:01:07,043 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2029 transitions. Word has length 41 [2019-12-07 14:01:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:07,043 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 2029 transitions. [2019-12-07 14:01:07,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:01:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2029 transitions. [2019-12-07 14:01:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:01:07,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:07,046 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 14:01:07,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-12-07 14:01:07,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:07,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141159136] [2019-12-07 14:01:07,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:01:07,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141159136] [2019-12-07 14:01:07,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:07,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:01:07,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43133436] [2019-12-07 14:01:07,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:01:07,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:01:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:01:07,113 INFO L87 Difference]: Start difference. First operand 895 states and 2029 transitions. Second operand 6 states. [2019-12-07 14:01:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:07,259 INFO L93 Difference]: Finished difference Result 2095 states and 4663 transitions. [2019-12-07 14:01:07,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:01:07,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 14:01:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:07,263 INFO L225 Difference]: With dead ends: 2095 [2019-12-07 14:01:07,263 INFO L226 Difference]: Without dead ends: 1429 [2019-12-07 14:01:07,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:01:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-12-07 14:01:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 960. [2019-12-07 14:01:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-07 14:01:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2183 transitions. [2019-12-07 14:01:07,278 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2183 transitions. Word has length 42 [2019-12-07 14:01:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:07,278 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2183 transitions. [2019-12-07 14:01:07,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:01:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2183 transitions. [2019-12-07 14:01:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:01:07,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:07,280 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 14:01:07,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-12-07 14:01:07,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:07,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368766138] [2019-12-07 14:01:07,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:07,341 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 14:01:07,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368766138] [2019-12-07 14:01:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:07,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:01:07,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378066167] [2019-12-07 14:01:07,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:01:07,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:01:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:01:07,342 INFO L87 Difference]: Start difference. First operand 960 states and 2183 transitions. Second operand 5 states. [2019-12-07 14:01:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:07,374 INFO L93 Difference]: Finished difference Result 1641 states and 3731 transitions. [2019-12-07 14:01:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:01:07,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 14:01:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:07,376 INFO L225 Difference]: With dead ends: 1641 [2019-12-07 14:01:07,377 INFO L226 Difference]: Without dead ends: 709 [2019-12-07 14:01:07,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:01:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-12-07 14:01:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-12-07 14:01:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-07 14:01:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1596 transitions. [2019-12-07 14:01:07,390 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1596 transitions. Word has length 42 [2019-12-07 14:01:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:07,391 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1596 transitions. [2019-12-07 14:01:07,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:01:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1596 transitions. [2019-12-07 14:01:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:01:07,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:07,393 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 14:01:07,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 3 times [2019-12-07 14:01:07,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:07,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949616940] [2019-12-07 14:01:07,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:01:07,467 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 14:01:07,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949616940] [2019-12-07 14:01:07,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:01:07,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:01:07,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778399538] [2019-12-07 14:01:07,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:01:07,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:01:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:01:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:01:07,468 INFO L87 Difference]: Start difference. First operand 709 states and 1596 transitions. Second operand 7 states. [2019-12-07 14:01:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:01:07,596 INFO L93 Difference]: Finished difference Result 1092 states and 2398 transitions. [2019-12-07 14:01:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:01:07,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 14:01:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:01:07,599 INFO L225 Difference]: With dead ends: 1092 [2019-12-07 14:01:07,599 INFO L226 Difference]: Without dead ends: 739 [2019-12-07 14:01:07,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:01:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-07 14:01:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 697. [2019-12-07 14:01:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 14:01:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-07 14:01:07,611 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 42 [2019-12-07 14:01:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:01:07,612 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-07 14:01:07,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:01:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-07 14:01:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:01:07,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:01:07,614 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 14:01:07,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:01:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:01:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 4 times [2019-12-07 14:01:07,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:01:07,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290879281] [2019-12-07 14:01:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:01:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:01:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:01:07,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:01:07,686 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:01:07,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:01:07,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:01:07,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:01:07,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1537509200 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1537509200 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1537509200|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1537509200 |P1Thread1of1ForFork0_#t~ite28_Out1537509200|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1537509200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1537509200} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1537509200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1537509200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1537509200|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:01:07,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-316470263 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-316470263 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-316470263 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-316470263 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-316470263 |P1Thread1of1ForFork0_#t~ite29_Out-316470263|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-316470263|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316470263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316470263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316470263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316470263} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316470263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316470263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316470263, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-316470263|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316470263} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:01:07,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In1677335297 ~y$r_buff0_thd2~0_Out1677335297)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1677335297 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1677335297 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out1677335297) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1677335297, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1677335297} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1677335297, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1677335297|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1677335297} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:01:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2117514069 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_Out2117514069| |P0Thread1of1ForFork1_#t~ite18_Out2117514069|) (= ~y$w_buff1_used~0_In2117514069 |P0Thread1of1ForFork1_#t~ite17_Out2117514069|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2117514069 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In2117514069 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In2117514069 256) 0) (and (= 0 (mod ~y$r_buff1_thd1~0_In2117514069 256)) .cse0))) .cse1) (and (= ~y$w_buff1_used~0_In2117514069 |P0Thread1of1ForFork1_#t~ite18_Out2117514069|) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite17_In2117514069| |P0Thread1of1ForFork1_#t~ite17_Out2117514069|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117514069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117514069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117514069, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In2117514069|, ~weak$$choice2~0=~weak$$choice2~0_In2117514069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117514069} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117514069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117514069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117514069, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out2117514069|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out2117514069|, ~weak$$choice2~0=~weak$$choice2~0_In2117514069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117514069} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 14:01:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:01:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:01:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-954380226 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-954380226 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-954380226 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-954380226 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-954380226 |P1Thread1of1ForFork0_#t~ite31_Out-954380226|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-954380226|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-954380226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-954380226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-954380226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954380226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-954380226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-954380226, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-954380226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-954380226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954380226} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1886909932 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1886909932 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1886909932| ~y$w_buff1~0_In-1886909932)) (and (or .cse1 .cse0) (= ~y~0_In-1886909932 |ULTIMATE.start_main_#t~ite34_Out-1886909932|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1886909932, ~y~0=~y~0_In-1886909932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886909932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886909932} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1886909932, ~y~0=~y~0_In-1886909932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886909932, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1886909932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886909932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1982576647 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1982576647 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1982576647| ~y$w_buff0_used~0_In1982576647)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1982576647| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1982576647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982576647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1982576647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982576647, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1982576647|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:01:07,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-870643043 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-870643043 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-870643043 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-870643043 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-870643043| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-870643043 |ULTIMATE.start_main_#t~ite37_Out-870643043|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-870643043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-870643043, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-870643043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-870643043} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-870643043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-870643043, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-870643043|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-870643043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-870643043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:01:07,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1953729702 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1953729702 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1953729702|)) (and (= ~y$r_buff0_thd0~0_In-1953729702 |ULTIMATE.start_main_#t~ite38_Out-1953729702|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953729702, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1953729702} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953729702, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1953729702, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1953729702|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:01:07,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2029065315 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2029065315 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2029065315 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-2029065315 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2029065315|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-2029065315 |ULTIMATE.start_main_#t~ite39_Out-2029065315|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029065315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2029065315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2029065315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029065315} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029065315, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2029065315|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2029065315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2029065315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029065315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:01:07,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:01:07,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:01:07 BasicIcfg [2019-12-07 14:01:07,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:01:07,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:01:07,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:01:07,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:01:07,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:01:01" (3/4) ... [2019-12-07 14:01:07,738 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:01:07,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:01:07,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:01:07,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:01:07,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1537509200 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1537509200 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1537509200|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1537509200 |P1Thread1of1ForFork0_#t~ite28_Out1537509200|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1537509200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1537509200} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1537509200, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1537509200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1537509200|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:01:07,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-316470263 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-316470263 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-316470263 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-316470263 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-316470263 |P1Thread1of1ForFork0_#t~ite29_Out-316470263|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-316470263|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316470263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316470263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316470263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316470263} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-316470263, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-316470263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-316470263, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-316470263|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-316470263} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:01:07,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In1677335297 ~y$r_buff0_thd2~0_Out1677335297)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1677335297 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1677335297 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out1677335297) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1677335297, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1677335297} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1677335297, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1677335297|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1677335297} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:01:07,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2117514069 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_Out2117514069| |P0Thread1of1ForFork1_#t~ite18_Out2117514069|) (= ~y$w_buff1_used~0_In2117514069 |P0Thread1of1ForFork1_#t~ite17_Out2117514069|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2117514069 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In2117514069 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In2117514069 256) 0) (and (= 0 (mod ~y$r_buff1_thd1~0_In2117514069 256)) .cse0))) .cse1) (and (= ~y$w_buff1_used~0_In2117514069 |P0Thread1of1ForFork1_#t~ite18_Out2117514069|) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite17_In2117514069| |P0Thread1of1ForFork1_#t~ite17_Out2117514069|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117514069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117514069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117514069, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In2117514069|, ~weak$$choice2~0=~weak$$choice2~0_In2117514069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117514069} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117514069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117514069, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117514069, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out2117514069|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out2117514069|, ~weak$$choice2~0=~weak$$choice2~0_In2117514069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117514069} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 14:01:07,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:01:07,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-954380226 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-954380226 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-954380226 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-954380226 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-954380226 |P1Thread1of1ForFork0_#t~ite31_Out-954380226|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-954380226|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-954380226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-954380226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-954380226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954380226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-954380226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-954380226, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-954380226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-954380226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-954380226} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1886909932 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1886909932 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1886909932| ~y$w_buff1~0_In-1886909932)) (and (or .cse1 .cse0) (= ~y~0_In-1886909932 |ULTIMATE.start_main_#t~ite34_Out-1886909932|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1886909932, ~y~0=~y~0_In-1886909932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886909932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886909932} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1886909932, ~y~0=~y~0_In-1886909932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1886909932, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1886909932|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886909932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:01:07,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1982576647 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1982576647 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1982576647| ~y$w_buff0_used~0_In1982576647)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1982576647| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1982576647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982576647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1982576647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1982576647, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1982576647|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:01:07,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-870643043 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-870643043 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-870643043 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-870643043 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-870643043| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-870643043 |ULTIMATE.start_main_#t~ite37_Out-870643043|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-870643043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-870643043, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-870643043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-870643043} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-870643043, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-870643043, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-870643043|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-870643043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-870643043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:01:07,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1953729702 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1953729702 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1953729702|)) (and (= ~y$r_buff0_thd0~0_In-1953729702 |ULTIMATE.start_main_#t~ite38_Out-1953729702|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953729702, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1953729702} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953729702, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1953729702, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1953729702|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:01:07,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2029065315 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2029065315 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2029065315 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-2029065315 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2029065315|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-2029065315 |ULTIMATE.start_main_#t~ite39_Out-2029065315|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029065315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2029065315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2029065315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029065315} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2029065315, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2029065315|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2029065315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2029065315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2029065315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:01:07,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:01:07,801 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8dfa074a-28a6-46d0-9275-69e5d881514c/bin/uautomizer/witness.graphml [2019-12-07 14:01:07,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:01:07,802 INFO L168 Benchmark]: Toolchain (without parser) took 6656.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 939.8 MB in the beginning and 960.2 MB in the end (delta: -20.4 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:01:07,802 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:01:07,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:01:07,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.17 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 14:01:07,803 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 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 14:01:07,803 INFO L168 Benchmark]: RCFGBuilder took 353.83 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.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:01:07,804 INFO L168 Benchmark]: TraceAbstraction took 5779.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 972.0 MB in the end (delta: 41.3 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:01:07,804 INFO L168 Benchmark]: Witness Printer took 65.37 ms. Allocated memory is still 1.3 GB. Free memory was 972.0 MB in the beginning and 960.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:01:07,806 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.51 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 353.83 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.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5779.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 972.0 MB in the end (delta: 41.3 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.37 ms. Allocated memory is still 1.3 GB. Free memory was 972.0 MB in the beginning and 960.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1659, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1660, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1271 SDtfs, 1347 SDslu, 2461 SDs, 0 SdLazy, 943 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6812occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1951 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 63403 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...