./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 61950e5134783ff41854193442a0b82c08021557 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:07:44,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:07:44,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:07:44,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:07:44,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:07:44,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:07:44,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:07:44,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:07:44,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:07:44,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:07:44,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:07:44,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:07:44,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:07:44,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:07:44,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:07:44,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:07:44,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:07:44,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:07:44,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:07:44,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:07:44,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:07:44,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:07:44,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:07:44,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:07:44,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:07:44,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:07:44,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:07:44,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:07:44,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:07:44,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:07:44,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:07:44,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:07:44,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:07:44,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:07:44,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:07:44,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:07:44,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:07:44,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:07:44,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:07:44,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:07:44,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:07:44,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:07:45,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:07:45,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:07:45,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:07:45,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:07:45,021 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:07:45,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:07:45,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:07:45,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:07:45,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:07:45,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:07:45,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:07:45,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:07:45,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:07:45,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:07:45,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:07:45,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:07:45,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:07:45,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:07:45,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:07:45,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:07:45,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:07:45,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:07:45,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:07:45,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:07:45,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:07:45,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:07:45,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:07:45,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:07:45,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:07:45,030 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 61950e5134783ff41854193442a0b82c08021557 [2019-11-28 18:07:45,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:07:45,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:07:45,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:07:45,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:07:45,394 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:07:45,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-11-28 18:07:45,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45302e2f/cfe417106a794023aa05e8d643363cd2/FLAG54abe332d [2019-11-28 18:07:46,071 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:07:46,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-11-28 18:07:46,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45302e2f/cfe417106a794023aa05e8d643363cd2/FLAG54abe332d [2019-11-28 18:07:46,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45302e2f/cfe417106a794023aa05e8d643363cd2 [2019-11-28 18:07:46,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:07:46,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:07:46,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:46,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:07:46,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:07:46,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:46" (1/1) ... [2019-11-28 18:07:46,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ceee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:46, skipping insertion in model container [2019-11-28 18:07:46,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:46" (1/1) ... [2019-11-28 18:07:46,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:07:46,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:07:46,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:46,979 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:07:47,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:47,152 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:07:47,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47 WrapperNode [2019-11-28 18:07:47,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:47,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:47,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:07:47,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:07:47,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:47,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:07:47,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:07:47,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:07:47,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:07:47,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:07:47,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:07:47,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:07:47,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:07:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:07:47,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:07:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:07:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:07:47,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:07:47,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:07:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:07:47,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:07:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:07:47,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:07:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:07:47,357 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:07:48,043 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:07:48,043 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:07:48,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48 BoogieIcfgContainer [2019-11-28 18:07:48,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:07:48,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:07:48,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:07:48,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:07:48,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:46" (1/3) ... [2019-11-28 18:07:48,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be702c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:48, skipping insertion in model container [2019-11-28 18:07:48,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (2/3) ... [2019-11-28 18:07:48,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be702c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:48, skipping insertion in model container [2019-11-28 18:07:48,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48" (3/3) ... [2019-11-28 18:07:48,058 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc.i [2019-11-28 18:07:48,068 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:07:48,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:07:48,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:07:48,082 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:07:48,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,190 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:07:48,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:07:48,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:07:48,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:07:48,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:07:48,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:07:48,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:07:48,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:07:48,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:07:48,231 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:07:48,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:48,321 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:48,321 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:48,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:07:48,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:48,407 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:48,408 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:48,414 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:07:48,432 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:07:48,434 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:07:53,076 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-28 18:07:53,483 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:07:53,591 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:07:53,656 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-11-28 18:07:53,656 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-11-28 18:07:53,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-11-28 18:07:54,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:07:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:07:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:07:54,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:54,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:07:54,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-11-28 18:07:54,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:54,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598081797] [2019-11-28 18:07:54,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:54,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598081797] [2019-11-28 18:07:54,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:54,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:07:54,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103341556] [2019-11-28 18:07:54,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:54,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:54,804 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:07:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:55,051 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-11-28 18:07:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:55,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:07:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:55,142 INFO L225 Difference]: With dead ends: 8468 [2019-11-28 18:07:55,142 INFO L226 Difference]: Without dead ends: 7976 [2019-11-28 18:07:55,144 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-11-28 18:07:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-11-28 18:07:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-11-28 18:07:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-11-28 18:07:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-11-28 18:07:55,572 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-11-28 18:07:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:55,572 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-11-28 18:07:55,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-11-28 18:07:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:07:55,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:55,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:55,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-11-28 18:07:55,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:55,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420873589] [2019-11-28 18:07:55,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:55,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420873589] [2019-11-28 18:07:55,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:55,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:07:55,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523551112] [2019-11-28 18:07:55,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:55,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:55,682 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-11-28 18:07:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:55,759 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-11-28 18:07:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:55,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:07:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:55,767 INFO L225 Difference]: With dead ends: 1834 [2019-11-28 18:07:55,767 INFO L226 Difference]: Without dead ends: 1342 [2019-11-28 18:07:55,768 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-11-28 18:07:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-28 18:07:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-11-28 18:07:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-28 18:07:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-11-28 18:07:55,810 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-11-28 18:07:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:55,811 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-11-28 18:07:55,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-11-28 18:07:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:07:55,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:55,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:55,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:55,819 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-11-28 18:07:55,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:55,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862653636] [2019-11-28 18:07:55,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:55,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862653636] [2019-11-28 18:07:55,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:55,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:55,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526253490] [2019-11-28 18:07:55,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:55,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:55,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:55,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:55,938 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-11-28 18:07:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:56,128 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-11-28 18:07:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:56,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:07:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:56,138 INFO L225 Difference]: With dead ends: 1673 [2019-11-28 18:07:56,138 INFO L226 Difference]: Without dead ends: 1673 [2019-11-28 18:07:56,139 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-11-28 18:07:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-11-28 18:07:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-11-28 18:07:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-11-28 18:07:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-11-28 18:07:56,184 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-11-28 18:07:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:56,185 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-11-28 18:07:56,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-11-28 18:07:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:07:56,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:56,189 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] [2019-11-28 18:07:56,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-11-28 18:07:56,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:56,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548881294] [2019-11-28 18:07:56,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:56,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548881294] [2019-11-28 18:07:56,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:56,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:56,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366728187] [2019-11-28 18:07:56,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:56,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:56,354 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-11-28 18:07:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:57,094 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-11-28 18:07:57,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:57,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:07:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:57,118 INFO L225 Difference]: With dead ends: 4481 [2019-11-28 18:07:57,118 INFO L226 Difference]: Without dead ends: 4446 [2019-11-28 18:07:57,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-11-28 18:07:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-11-28 18:07:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-11-28 18:07:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-11-28 18:07:57,193 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-11-28 18:07:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:57,194 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-11-28 18:07:57,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-11-28 18:07:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:57,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:57,197 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-11-28 18:07:57,197 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-11-28 18:07:57,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:57,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892061758] [2019-11-28 18:07:57,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:57,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892061758] [2019-11-28 18:07:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:07:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108345291] [2019-11-28 18:07:57,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:57,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:57,278 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-11-28 18:07:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:57,775 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-11-28 18:07:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:07:57,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:07:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:57,792 INFO L225 Difference]: With dead ends: 3139 [2019-11-28 18:07:57,792 INFO L226 Difference]: Without dead ends: 3139 [2019-11-28 18:07:57,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-11-28 18:07:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-11-28 18:07:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-28 18:07:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-11-28 18:07:57,852 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-11-28 18:07:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:57,853 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-11-28 18:07:57,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-11-28 18:07:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:57,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:57,857 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-11-28 18:07:57,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-11-28 18:07:57,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:57,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296802083] [2019-11-28 18:07:57,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:57,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296802083] [2019-11-28 18:07:57,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:57,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:57,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467356230] [2019-11-28 18:07:57,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:57,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:57,942 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-11-28 18:07:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:58,534 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-11-28 18:07:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:58,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:07:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:58,551 INFO L225 Difference]: With dead ends: 5512 [2019-11-28 18:07:58,551 INFO L226 Difference]: Without dead ends: 5483 [2019-11-28 18:07:58,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-11-28 18:07:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-11-28 18:07:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-11-28 18:07:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-11-28 18:07:58,638 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-11-28 18:07:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:58,639 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-11-28 18:07:58,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-11-28 18:07:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:07:58,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:58,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:58,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-11-28 18:07:58,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:58,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860813020] [2019-11-28 18:07:58,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:58,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860813020] [2019-11-28 18:07:58,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:58,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:58,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906749490] [2019-11-28 18:07:58,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:58,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:58,723 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 3 states. [2019-11-28 18:07:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:58,759 INFO L93 Difference]: Finished difference Result 4752 states and 10724 transitions. [2019-11-28 18:07:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:58,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 18:07:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:58,770 INFO L225 Difference]: With dead ends: 4752 [2019-11-28 18:07:58,771 INFO L226 Difference]: Without dead ends: 4012 [2019-11-28 18:07:58,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-11-28 18:07:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3996. [2019-11-28 18:07:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2019-11-28 18:07:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 9096 transitions. [2019-11-28 18:07:58,877 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 9096 transitions. Word has length 27 [2019-11-28 18:07:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:58,877 INFO L462 AbstractCegarLoop]: Abstraction has 3996 states and 9096 transitions. [2019-11-28 18:07:58,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 9096 transitions. [2019-11-28 18:07:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:07:58,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:58,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:58,885 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:58,886 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-11-28 18:07:58,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:58,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896803606] [2019-11-28 18:07:58,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:58,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896803606] [2019-11-28 18:07:58,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:58,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:58,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106621072] [2019-11-28 18:07:58,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:58,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:58,956 INFO L87 Difference]: Start difference. First operand 3996 states and 9096 transitions. Second operand 5 states. [2019-11-28 18:07:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:59,008 INFO L93 Difference]: Finished difference Result 2427 states and 5306 transitions. [2019-11-28 18:07:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:59,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:07:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:59,014 INFO L225 Difference]: With dead ends: 2427 [2019-11-28 18:07:59,014 INFO L226 Difference]: Without dead ends: 2163 [2019-11-28 18:07:59,014 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-11-28 18:07:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-11-28 18:07:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1308. [2019-11-28 18:07:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-11-28 18:07:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2862 transitions. [2019-11-28 18:07:59,049 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2862 transitions. Word has length 28 [2019-11-28 18:07:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:59,049 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 2862 transitions. [2019-11-28 18:07:59,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2862 transitions. [2019-11-28 18:07:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:07:59,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:59,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:59,054 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-11-28 18:07:59,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:59,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33588838] [2019-11-28 18:07:59,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:59,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33588838] [2019-11-28 18:07:59,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:59,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:59,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373997476] [2019-11-28 18:07:59,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:59,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:59,140 INFO L87 Difference]: Start difference. First operand 1308 states and 2862 transitions. Second operand 3 states. [2019-11-28 18:07:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:59,196 INFO L93 Difference]: Finished difference Result 1701 states and 3674 transitions. [2019-11-28 18:07:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:59,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:07:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:59,200 INFO L225 Difference]: With dead ends: 1701 [2019-11-28 18:07:59,201 INFO L226 Difference]: Without dead ends: 1701 [2019-11-28 18:07:59,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-11-28 18:07:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1376. [2019-11-28 18:07:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-11-28 18:07:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3024 transitions. [2019-11-28 18:07:59,239 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3024 transitions. Word has length 51 [2019-11-28 18:07:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:59,239 INFO L462 AbstractCegarLoop]: Abstraction has 1376 states and 3024 transitions. [2019-11-28 18:07:59,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3024 transitions. [2019-11-28 18:07:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:07:59,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:59,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:59,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-11-28 18:07:59,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:59,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397732255] [2019-11-28 18:07:59,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:59,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397732255] [2019-11-28 18:07:59,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:59,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:07:59,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863633621] [2019-11-28 18:07:59,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:07:59,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:07:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:07:59,511 INFO L87 Difference]: Start difference. First operand 1376 states and 3024 transitions. Second operand 9 states. [2019-11-28 18:08:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:01,677 INFO L93 Difference]: Finished difference Result 11276 states and 24181 transitions. [2019-11-28 18:08:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-28 18:08:01,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-28 18:08:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:01,698 INFO L225 Difference]: With dead ends: 11276 [2019-11-28 18:08:01,699 INFO L226 Difference]: Without dead ends: 8051 [2019-11-28 18:08:01,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=547, Invalid=1805, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 18:08:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8051 states. [2019-11-28 18:08:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8051 to 1628. [2019-11-28 18:08:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-28 18:08:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 3575 transitions. [2019-11-28 18:08:01,797 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 3575 transitions. Word has length 52 [2019-11-28 18:08:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:01,798 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 3575 transitions. [2019-11-28 18:08:01,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:08:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 3575 transitions. [2019-11-28 18:08:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:01,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:01,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:01,804 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-11-28 18:08:01,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20221955] [2019-11-28 18:08:01,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:01,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20221955] [2019-11-28 18:08:01,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:01,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:08:01,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938707759] [2019-11-28 18:08:01,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:01,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:01,945 INFO L87 Difference]: Start difference. First operand 1628 states and 3575 transitions. Second operand 7 states. [2019-11-28 18:08:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:03,111 INFO L93 Difference]: Finished difference Result 2941 states and 6153 transitions. [2019-11-28 18:08:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:08:03,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:08:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:03,118 INFO L225 Difference]: With dead ends: 2941 [2019-11-28 18:08:03,118 INFO L226 Difference]: Without dead ends: 2941 [2019-11-28 18:08:03,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:08:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2019-11-28 18:08:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1646. [2019-11-28 18:08:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-11-28 18:08:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3604 transitions. [2019-11-28 18:08:03,158 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3604 transitions. Word has length 52 [2019-11-28 18:08:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:03,158 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3604 transitions. [2019-11-28 18:08:03,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3604 transitions. [2019-11-28 18:08:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:03,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:03,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:03,163 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:03,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1165405280, now seen corresponding path program 2 times [2019-11-28 18:08:03,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:03,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797516907] [2019-11-28 18:08:03,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:03,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797516907] [2019-11-28 18:08:03,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:03,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:03,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571882803] [2019-11-28 18:08:03,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:03,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:03,237 INFO L87 Difference]: Start difference. First operand 1646 states and 3604 transitions. Second operand 4 states. [2019-11-28 18:08:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:03,303 INFO L93 Difference]: Finished difference Result 1632 states and 3562 transitions. [2019-11-28 18:08:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:08:03,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:08:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:03,308 INFO L225 Difference]: With dead ends: 1632 [2019-11-28 18:08:03,308 INFO L226 Difference]: Without dead ends: 1632 [2019-11-28 18:08:03,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:08:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2019-11-28 18:08:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1538. [2019-11-28 18:08:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-28 18:08:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3347 transitions. [2019-11-28 18:08:03,336 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3347 transitions. Word has length 52 [2019-11-28 18:08:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:03,337 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3347 transitions. [2019-11-28 18:08:03,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3347 transitions. [2019-11-28 18:08:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:03,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:03,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:03,342 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1952234998, now seen corresponding path program 1 times [2019-11-28 18:08:03,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:03,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556030571] [2019-11-28 18:08:03,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:03,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556030571] [2019-11-28 18:08:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:03,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:03,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455017309] [2019-11-28 18:08:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:03,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:03,388 INFO L87 Difference]: Start difference. First operand 1538 states and 3347 transitions. Second operand 3 states. [2019-11-28 18:08:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:03,427 INFO L93 Difference]: Finished difference Result 1936 states and 4043 transitions. [2019-11-28 18:08:03,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:03,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:03,432 INFO L225 Difference]: With dead ends: 1936 [2019-11-28 18:08:03,432 INFO L226 Difference]: Without dead ends: 1900 [2019-11-28 18:08:03,433 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-11-28 18:08:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-11-28 18:08:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1478. [2019-11-28 18:08:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2019-11-28 18:08:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 3163 transitions. [2019-11-28 18:08:03,463 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 3163 transitions. Word has length 52 [2019-11-28 18:08:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:03,464 INFO L462 AbstractCegarLoop]: Abstraction has 1478 states and 3163 transitions. [2019-11-28 18:08:03,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 3163 transitions. [2019-11-28 18:08:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:03,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:03,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:03,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2030779203, now seen corresponding path program 2 times [2019-11-28 18:08:03,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:03,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336462038] [2019-11-28 18:08:03,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:03,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336462038] [2019-11-28 18:08:03,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:03,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:03,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839236298] [2019-11-28 18:08:03,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:03,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:03,584 INFO L87 Difference]: Start difference. First operand 1478 states and 3163 transitions. Second operand 4 states. [2019-11-28 18:08:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:03,617 INFO L93 Difference]: Finished difference Result 2602 states and 5559 transitions. [2019-11-28 18:08:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:08:03,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:08:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:03,621 INFO L225 Difference]: With dead ends: 2602 [2019-11-28 18:08:03,622 INFO L226 Difference]: Without dead ends: 1199 [2019-11-28 18:08:03,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-28 18:08:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-11-28 18:08:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-11-28 18:08:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2540 transitions. [2019-11-28 18:08:03,653 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2540 transitions. Word has length 52 [2019-11-28 18:08:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:03,654 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 2540 transitions. [2019-11-28 18:08:03,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2540 transitions. [2019-11-28 18:08:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:03,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:03,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:03,660 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1229041791, now seen corresponding path program 3 times [2019-11-28 18:08:03,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:03,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182996403] [2019-11-28 18:08:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:03,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182996403] [2019-11-28 18:08:03,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:03,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:08:03,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504598674] [2019-11-28 18:08:03,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:08:03,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:08:03,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:08:03,836 INFO L87 Difference]: Start difference. First operand 1199 states and 2540 transitions. Second operand 8 states. [2019-11-28 18:08:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:05,243 INFO L93 Difference]: Finished difference Result 2183 states and 4451 transitions. [2019-11-28 18:08:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 18:08:05,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-28 18:08:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:05,249 INFO L225 Difference]: With dead ends: 2183 [2019-11-28 18:08:05,249 INFO L226 Difference]: Without dead ends: 2183 [2019-11-28 18:08:05,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-11-28 18:08:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-11-28 18:08:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1224. [2019-11-28 18:08:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-28 18:08:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 2590 transitions. [2019-11-28 18:08:05,276 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 2590 transitions. Word has length 52 [2019-11-28 18:08:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:05,277 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 2590 transitions. [2019-11-28 18:08:05,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:08:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 2590 transitions. [2019-11-28 18:08:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:05,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:05,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:05,281 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1250007013, now seen corresponding path program 4 times [2019-11-28 18:08:05,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:05,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70065185] [2019-11-28 18:08:05,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:05,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70065185] [2019-11-28 18:08:05,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:05,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:08:05,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615685624] [2019-11-28 18:08:05,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:08:05,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:08:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:08:05,571 INFO L87 Difference]: Start difference. First operand 1224 states and 2590 transitions. Second operand 12 states. [2019-11-28 18:08:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:06,833 INFO L93 Difference]: Finished difference Result 1971 states and 4125 transitions. [2019-11-28 18:08:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 18:08:06,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-11-28 18:08:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,837 INFO L225 Difference]: With dead ends: 1971 [2019-11-28 18:08:06,837 INFO L226 Difference]: Without dead ends: 1962 [2019-11-28 18:08:06,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-11-28 18:08:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-28 18:08:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1251. [2019-11-28 18:08:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-11-28 18:08:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2655 transitions. [2019-11-28 18:08:06,860 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2655 transitions. Word has length 52 [2019-11-28 18:08:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:06,861 INFO L462 AbstractCegarLoop]: Abstraction has 1251 states and 2655 transitions. [2019-11-28 18:08:06,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:08:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2655 transitions. [2019-11-28 18:08:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:06,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:06,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:06,864 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1423404713, now seen corresponding path program 5 times [2019-11-28 18:08:06,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:06,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819280798] [2019-11-28 18:08:06,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:06,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819280798] [2019-11-28 18:08:06,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:06,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:06,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985160868] [2019-11-28 18:08:06,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:06,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:06,937 INFO L87 Difference]: Start difference. First operand 1251 states and 2655 transitions. Second operand 3 states. [2019-11-28 18:08:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:06,952 INFO L93 Difference]: Finished difference Result 1250 states and 2653 transitions. [2019-11-28 18:08:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:06,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,954 INFO L225 Difference]: With dead ends: 1250 [2019-11-28 18:08:06,955 INFO L226 Difference]: Without dead ends: 1250 [2019-11-28 18:08:06,955 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-11-28 18:08:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-11-28 18:08:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 949. [2019-11-28 18:08:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-11-28 18:08:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2040 transitions. [2019-11-28 18:08:06,971 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2040 transitions. Word has length 52 [2019-11-28 18:08:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:06,972 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2040 transitions. [2019-11-28 18:08:06,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2040 transitions. [2019-11-28 18:08:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:08:06,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:06,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:06,975 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 1 times [2019-11-28 18:08:06,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:06,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689290657] [2019-11-28 18:08:06,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689290657] [2019-11-28 18:08:07,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:07,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:07,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463157159] [2019-11-28 18:08:07,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:07,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:07,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:07,051 INFO L87 Difference]: Start difference. First operand 949 states and 2040 transitions. Second operand 7 states. [2019-11-28 18:08:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:07,199 INFO L93 Difference]: Finished difference Result 1535 states and 3201 transitions. [2019-11-28 18:08:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:08:07,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:08:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:07,202 INFO L225 Difference]: With dead ends: 1535 [2019-11-28 18:08:07,202 INFO L226 Difference]: Without dead ends: 1074 [2019-11-28 18:08:07,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:08:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-11-28 18:08:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 932. [2019-11-28 18:08:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2019-11-28 18:08:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1979 transitions. [2019-11-28 18:08:07,216 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1979 transitions. Word has length 53 [2019-11-28 18:08:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:07,217 INFO L462 AbstractCegarLoop]: Abstraction has 932 states and 1979 transitions. [2019-11-28 18:08:07,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1979 transitions. [2019-11-28 18:08:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:08:07,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:07,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:07,219 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 2 times [2019-11-28 18:08:07,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:07,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782245645] [2019-11-28 18:08:07,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:07,315 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:08:07,315 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:08:07,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= |v_ULTIMATE.start_main_~#t589~0.offset_20| 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t589~0.base_29| 4)) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t589~0.base_29|) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29|) |v_ULTIMATE.start_main_~#t589~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_14|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t589~0.base=|v_ULTIMATE.start_main_~#t589~0.base_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t589~0.offset=|v_ULTIMATE.start_main_~#t589~0.offset_20|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t590~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t590~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t589~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_~#t589~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:08:07,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12|) |v_ULTIMATE.start_main_~#t590~0.offset_10| 1)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t590~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t590~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t590~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t590~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_10|, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t590~0.offset, ULTIMATE.start_main_~#t590~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:08:07,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:08:07,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-391882323 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-391882323 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-391882323| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-391882323| ~y$w_buff0_used~0_In-391882323)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-391882323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391882323} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-391882323|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-391882323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391882323} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:07,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1331106573 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1331106573| ~y$w_buff0~0_In1331106573) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1331106573| |P1Thread1of1ForFork1_#t~ite14_Out1331106573|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1331106573| |P1Thread1of1ForFork1_#t~ite14_Out1331106573|) (= ~y$w_buff0~0_In1331106573 |P1Thread1of1ForFork1_#t~ite14_Out1331106573|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1331106573 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1331106573 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In1331106573 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1331106573 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331106573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$w_buff0~0=~y$w_buff0~0_In1331106573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1331106573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331106573} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331106573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$w_buff0~0=~y$w_buff0~0_In1331106573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331106573, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1331106573|, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1331106573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331106573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:07,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1679647422 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| ~y$w_buff1~0_In1679647422) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= ~y$w_buff1~0_In1679647422 |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1679647422 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1679647422 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In1679647422 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1679647422 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1679647422, ~y$w_buff1~0=~y$w_buff1~0_In1679647422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1679647422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1679647422} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1679647422|, ~y$w_buff1~0=~y$w_buff1~0_In1679647422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1679647422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1679647422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:07,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1829356840 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1829356840 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1829356840 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1829356840 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1829356840| ~y$w_buff1_used~0_In-1829356840)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1829356840| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1829356840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829356840, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1829356840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829356840} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1829356840|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1829356840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829356840, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1829356840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829356840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:07,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-478704613 ~y$r_buff0_thd1~0_Out-478704613)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-478704613 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-478704613 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-478704613) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-478704613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-478704613} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-478704613, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-478704613|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-478704613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:07,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-896322705 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-896322705 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-896322705 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-896322705 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-896322705| ~y$r_buff1_thd1~0_In-896322705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-896322705| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-896322705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896322705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896322705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896322705} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-896322705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896322705, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-896322705|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896322705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896322705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:07,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2038232838 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2038232838| |P1Thread1of1ForFork1_#t~ite20_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite21_Out-2038232838| ~y$w_buff0_used~0_In-2038232838)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-2038232838| ~y$w_buff0_used~0_In-2038232838) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2038232838 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2038232838 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-2038232838 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2038232838 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2038232838| |P1Thread1of1ForFork1_#t~ite20_Out-2038232838|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2038232838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2038232838, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2038232838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2038232838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2038232838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2038232838, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2038232838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2038232838, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2038232838|, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2038232838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:07,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:07,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In974516619 256) 0))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In974516619 |P1Thread1of1ForFork1_#t~ite29_Out974516619|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In974516619 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In974516619 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In974516619 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In974516619 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out974516619| |P1Thread1of1ForFork1_#t~ite29_Out974516619|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out974516619| ~y$r_buff1_thd2~0_In974516619) (= |P1Thread1of1ForFork1_#t~ite29_In974516619| |P1Thread1of1ForFork1_#t~ite29_Out974516619|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974516619, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In974516619|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974516619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974516619, ~weak$$choice2~0=~weak$$choice2~0_In974516619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974516619} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974516619, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out974516619|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out974516619|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974516619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974516619, ~weak$$choice2~0=~weak$$choice2~0_In974516619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974516619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:07,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:08:07,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In45929107 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In45929107 256)))) (or (and (= ~y~0_In45929107 |P1Thread1of1ForFork1_#t~ite32_Out45929107|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In45929107 |P1Thread1of1ForFork1_#t~ite32_Out45929107|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45929107, ~y$w_buff1~0=~y$w_buff1~0_In45929107, ~y~0=~y~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45929107, ~y$w_buff1~0=~y$w_buff1~0_In45929107, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out45929107|, ~y~0=~y~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:07,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-844393242 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-844393242 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-844393242|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-844393242| ~y$w_buff0_used~0_In-844393242) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-844393242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-844393242, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-844393242|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:07,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1895488714 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1895488714 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1895488714 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1895488714 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| ~y$w_buff1_used~0_In-1895488714)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1895488714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895488714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895488714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1895488714} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1895488714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895488714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895488714, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1895488714|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1895488714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:07,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-430635939 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-430635939 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-430635939 |P1Thread1of1ForFork1_#t~ite36_Out-430635939|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-430635939|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-430635939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430635939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-430635939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430635939, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-430635939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:07,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In342406594 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In342406594 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In342406594 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In342406594 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out342406594| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In342406594 |P1Thread1of1ForFork1_#t~ite37_Out342406594|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342406594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342406594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342406594} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342406594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342406594, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out342406594|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342406594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:07,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:07,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:07,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In204821837 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In204821837 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out204821837| ~y$w_buff1~0_In204821837) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out204821837| ~y~0_In204821837)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In204821837, ~y~0=~y~0_In204821837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In204821837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In204821837} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out204821837|, ~y$w_buff1~0=~y$w_buff1~0_In204821837, ~y~0=~y~0_In204821837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In204821837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In204821837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:07,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-549502459 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-549502459 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-549502459| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-549502459 |ULTIMATE.start_main_#t~ite42_Out-549502459|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-549502459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-549502459} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-549502459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-549502459, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-549502459|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:07,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1098632865 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1098632865 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1098632865 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1098632865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1098632865| ~y$w_buff1_used~0_In-1098632865) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1098632865| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098632865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098632865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098632865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098632865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098632865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098632865, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1098632865|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098632865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098632865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:07,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1142540695 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1142540695 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1142540695| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1142540695| ~y$r_buff0_thd0~0_In1142540695) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1142540695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1142540695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1142540695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1142540695, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1142540695|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:07,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1057586366 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1057586366 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1057586366 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1057586366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1057586366| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1057586366| ~y$r_buff1_thd0~0_In-1057586366) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057586366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1057586366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1057586366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057586366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057586366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1057586366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1057586366, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1057586366|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057586366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:07,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:07,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:07 BasicIcfg [2019-11-28 18:08:07,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:08:07,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:08:07,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:08:07,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:08:07,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48" (3/4) ... [2019-11-28 18:08:07,403 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:08:07,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= |v_ULTIMATE.start_main_~#t589~0.offset_20| 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t589~0.base_29| 4)) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t589~0.base_29|) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29|) |v_ULTIMATE.start_main_~#t589~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_14|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t589~0.base=|v_ULTIMATE.start_main_~#t589~0.base_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t589~0.offset=|v_ULTIMATE.start_main_~#t589~0.offset_20|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t590~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t590~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t589~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_~#t589~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:08:07,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12|) |v_ULTIMATE.start_main_~#t590~0.offset_10| 1)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t590~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t590~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t590~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t590~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_10|, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t590~0.offset, ULTIMATE.start_main_~#t590~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:08:07,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:08:07,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-391882323 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-391882323 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-391882323| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-391882323| ~y$w_buff0_used~0_In-391882323)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-391882323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391882323} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-391882323|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-391882323, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-391882323} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:07,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1331106573 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1331106573| ~y$w_buff0~0_In1331106573) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1331106573| |P1Thread1of1ForFork1_#t~ite14_Out1331106573|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1331106573| |P1Thread1of1ForFork1_#t~ite14_Out1331106573|) (= ~y$w_buff0~0_In1331106573 |P1Thread1of1ForFork1_#t~ite14_Out1331106573|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1331106573 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1331106573 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In1331106573 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1331106573 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331106573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$w_buff0~0=~y$w_buff0~0_In1331106573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331106573, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1331106573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331106573} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331106573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$w_buff0~0=~y$w_buff0~0_In1331106573, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331106573, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1331106573|, ~weak$$choice2~0=~weak$$choice2~0_In1331106573, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1331106573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331106573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:07,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1679647422 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| ~y$w_buff1~0_In1679647422) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1679647422| |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) (= ~y$w_buff1~0_In1679647422 |P1Thread1of1ForFork1_#t~ite17_Out1679647422|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1679647422 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1679647422 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In1679647422 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1679647422 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1679647422, ~y$w_buff1~0=~y$w_buff1~0_In1679647422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1679647422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1679647422} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1679647422, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1679647422|, ~y$w_buff1~0=~y$w_buff1~0_In1679647422, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1679647422, ~weak$$choice2~0=~weak$$choice2~0_In1679647422, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1679647422|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1679647422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:07,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1829356840 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1829356840 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1829356840 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1829356840 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1829356840| ~y$w_buff1_used~0_In-1829356840)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1829356840| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1829356840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829356840, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1829356840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829356840} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1829356840|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1829356840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1829356840, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1829356840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1829356840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:07,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-478704613 ~y$r_buff0_thd1~0_Out-478704613)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-478704613 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-478704613 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-478704613) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-478704613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-478704613} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-478704613, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-478704613|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-478704613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:07,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-896322705 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-896322705 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-896322705 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-896322705 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-896322705| ~y$r_buff1_thd1~0_In-896322705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-896322705| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-896322705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896322705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896322705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896322705} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-896322705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896322705, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-896322705|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896322705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896322705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:07,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2038232838 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2038232838| |P1Thread1of1ForFork1_#t~ite20_Out-2038232838|) (= |P1Thread1of1ForFork1_#t~ite21_Out-2038232838| ~y$w_buff0_used~0_In-2038232838)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-2038232838| ~y$w_buff0_used~0_In-2038232838) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2038232838 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2038232838 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-2038232838 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2038232838 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2038232838| |P1Thread1of1ForFork1_#t~ite20_Out-2038232838|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2038232838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2038232838, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2038232838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2038232838, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2038232838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2038232838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2038232838, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2038232838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2038232838, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2038232838|, ~weak$$choice2~0=~weak$$choice2~0_In-2038232838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2038232838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:07,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:07,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In974516619 256) 0))) (or (and .cse0 (= ~y$r_buff1_thd2~0_In974516619 |P1Thread1of1ForFork1_#t~ite29_Out974516619|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In974516619 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In974516619 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In974516619 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In974516619 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out974516619| |P1Thread1of1ForFork1_#t~ite29_Out974516619|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out974516619| ~y$r_buff1_thd2~0_In974516619) (= |P1Thread1of1ForFork1_#t~ite29_In974516619| |P1Thread1of1ForFork1_#t~ite29_Out974516619|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974516619, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In974516619|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974516619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974516619, ~weak$$choice2~0=~weak$$choice2~0_In974516619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974516619} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In974516619, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out974516619|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out974516619|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In974516619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974516619, ~weak$$choice2~0=~weak$$choice2~0_In974516619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974516619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:07,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:08:07,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In45929107 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In45929107 256)))) (or (and (= ~y~0_In45929107 |P1Thread1of1ForFork1_#t~ite32_Out45929107|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In45929107 |P1Thread1of1ForFork1_#t~ite32_Out45929107|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45929107, ~y$w_buff1~0=~y$w_buff1~0_In45929107, ~y~0=~y~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In45929107, ~y$w_buff1~0=~y$w_buff1~0_In45929107, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out45929107|, ~y~0=~y~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:07,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-844393242 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-844393242 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-844393242|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-844393242| ~y$w_buff0_used~0_In-844393242) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-844393242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-844393242, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-844393242|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:07,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1895488714 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1895488714 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1895488714 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1895488714 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| ~y$w_buff1_used~0_In-1895488714)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1895488714| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1895488714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895488714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895488714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1895488714} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1895488714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1895488714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1895488714, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1895488714|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1895488714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:07,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-430635939 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-430635939 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-430635939 |P1Thread1of1ForFork1_#t~ite36_Out-430635939|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-430635939|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-430635939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430635939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-430635939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-430635939, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-430635939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:07,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In342406594 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In342406594 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In342406594 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In342406594 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out342406594| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In342406594 |P1Thread1of1ForFork1_#t~ite37_Out342406594|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342406594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342406594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342406594} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In342406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342406594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In342406594, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out342406594|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342406594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:07,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:07,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:07,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In204821837 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In204821837 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out204821837| ~y$w_buff1~0_In204821837) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out204821837| ~y~0_In204821837)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In204821837, ~y~0=~y~0_In204821837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In204821837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In204821837} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out204821837|, ~y$w_buff1~0=~y$w_buff1~0_In204821837, ~y~0=~y~0_In204821837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In204821837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In204821837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:07,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:08:07,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-549502459 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-549502459 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-549502459| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-549502459 |ULTIMATE.start_main_#t~ite42_Out-549502459|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-549502459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-549502459} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-549502459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-549502459, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-549502459|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:07,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1098632865 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1098632865 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1098632865 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1098632865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1098632865| ~y$w_buff1_used~0_In-1098632865) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1098632865| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098632865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098632865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098632865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098632865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098632865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098632865, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1098632865|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098632865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098632865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:07,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1142540695 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1142540695 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1142540695| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1142540695| ~y$r_buff0_thd0~0_In1142540695) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1142540695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1142540695} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1142540695, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1142540695, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1142540695|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:07,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1057586366 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1057586366 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1057586366 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1057586366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1057586366| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1057586366| ~y$r_buff1_thd0~0_In-1057586366) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057586366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1057586366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1057586366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057586366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057586366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1057586366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1057586366, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1057586366|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057586366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:07,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:07,511 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:08:07,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:08:07,513 INFO L168 Benchmark]: Toolchain (without parser) took 21108.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.9 MB). Free memory was 953.6 MB in the beginning and 902.7 MB in the end (delta: 50.9 MB). Peak memory consumption was 480.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,514 INFO L168 Benchmark]: CDTParser took 0.98 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:08:07,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.24 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-11-28 18:08:07,516 INFO L168 Benchmark]: Boogie Preprocessor took 64.41 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,516 INFO L168 Benchmark]: RCFGBuilder took 751.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,517 INFO L168 Benchmark]: TraceAbstraction took 19349.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.0 GB in the beginning and 915.0 MB in the end (delta: 116.3 MB). Peak memory consumption was 430.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,517 INFO L168 Benchmark]: Witness Printer took 116.04 ms. Allocated memory is still 1.5 GB. Free memory was 915.0 MB in the beginning and 902.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:07,520 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.98 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.41 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 751.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19349.58 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.0 GB in the beginning and 915.0 MB in the end (delta: 116.3 MB). Peak memory consumption was 430.3 MB. Max. memory is 11.5 GB. * Witness Printer took 116.04 ms. Allocated memory is still 1.5 GB. Free memory was 915.0 MB in the beginning and 902.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2467 SDtfs, 3938 SDslu, 5904 SDs, 0 SdLazy, 4983 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 39 SyntacticMatches, 15 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 17253 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 131760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...