./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash deb8cdfe21029d80fab6a6570a739cf4ca5c0ebd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:09:37,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:09:37,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:09:37,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:09:37,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:09:37,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:09:37,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:09:37,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:09:37,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:09:37,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:09:37,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:09:37,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:09:37,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:09:37,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:09:37,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:09:37,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:09:37,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:09:37,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:09:37,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:09:37,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:09:37,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:09:37,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:09:37,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:09:37,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:09:37,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:09:37,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:09:37,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:09:37,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:09:37,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:09:37,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:09:37,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:09:37,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:09:37,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:09:37,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:09:37,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:09:37,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:09:37,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:09:37,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:09:37,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:09:37,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:09:37,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:09:37,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:09:37,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:09:37,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:09:37,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:09:37,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:09:37,992 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:09:37,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:09:37,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:09:37,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:09:37,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:09:37,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:09:37,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:09:37,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deb8cdfe21029d80fab6a6570a739cf4ca5c0ebd [2019-12-07 14:09:38,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:09:38,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:09:38,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:09:38,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:09:38,103 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:09:38,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_tso.oepc.i [2019-12-07 14:09:38,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/data/722559961/cb413d3e3e5a468a935f7fc19a5c327e/FLAG1fa8db18b [2019-12-07 14:09:38,576 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:09:38,576 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/sv-benchmarks/c/pthread-wmm/mix000_tso.oepc.i [2019-12-07 14:09:38,587 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/data/722559961/cb413d3e3e5a468a935f7fc19a5c327e/FLAG1fa8db18b [2019-12-07 14:09:38,596 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/data/722559961/cb413d3e3e5a468a935f7fc19a5c327e [2019-12-07 14:09:38,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:09:38,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:09:38,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:09:38,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:09:38,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:09:38,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:38,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38, skipping insertion in model container [2019-12-07 14:09:38,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:38,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:09:38,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:09:38,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:09:38,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:09:38,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:09:38,990 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:09:38,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38 WrapperNode [2019-12-07 14:09:38,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:09:38,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:09:38,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:09:38,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:09:38,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:09:39,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:09:39,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:09:39,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:09:39,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... [2019-12-07 14:09:39,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:09:39,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:09:39,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:09:39,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:09:39,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:09:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:09:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:09:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:09:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:09:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:09:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:09:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:09:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:09:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:09:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:09:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:09:39,119 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:09:39,527 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:09:39,527 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:09:39,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:09:39 BoogieIcfgContainer [2019-12-07 14:09:39,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:09:39,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:09:39,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:09:39,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:09:39,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:09:38" (1/3) ... [2019-12-07 14:09:39,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6730a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:09:39, skipping insertion in model container [2019-12-07 14:09:39,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:09:38" (2/3) ... [2019-12-07 14:09:39,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6730a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:09:39, skipping insertion in model container [2019-12-07 14:09:39,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:09:39" (3/3) ... [2019-12-07 14:09:39,533 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_tso.oepc.i [2019-12-07 14:09:39,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:09:39,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:09:39,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:09:39,545 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:09:39,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:09:39,624 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:09:39,624 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:09:39,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:09:39,625 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:09:39,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:09:39,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:09:39,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:09:39,625 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:09:39,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 14:09:39,637 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 14:09:39,699 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 14:09:39,700 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:09:39,714 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 14:09:39,737 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 14:09:39,778 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 14:09:39,778 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:09:39,787 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 14:09:39,813 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 14:09:39,814 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:09:42,958 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 14:09:43,226 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 14:09:43,321 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 14:09:43,321 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 14:09:43,323 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 14:09:44,901 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 14:09:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 14:09:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:09:44,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:44,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:09:44,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 14:09:44,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:44,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881282901] [2019-12-07 14:09:44,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:45,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881282901] [2019-12-07 14:09:45,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:45,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:09:45,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835199836] [2019-12-07 14:09:45,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:09:45,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:09:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:45,070 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 14:09:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:45,360 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 14:09:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:09:45,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:09:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:45,528 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 14:09:45,528 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 14:09:45,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 14:09:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 14:09:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 14:09:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 14:09:46,535 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 14:09:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:46,535 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 14:09:46,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:09:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 14:09:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:09:46,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:46,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:46,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-07 14:09:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:46,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202916020] [2019-12-07 14:09:46,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:46,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202916020] [2019-12-07 14:09:46,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:46,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:09:46,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25057106] [2019-12-07 14:09:46,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:09:46,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:09:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:09:46,605 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 14:09:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:46,996 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 14:09:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:09:46,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:09:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:47,105 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 14:09:47,105 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 14:09:47,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:09:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 14:09:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 14:09:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 14:09:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 14:09:48,331 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 14:09:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:48,331 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 14:09:48,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:09:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 14:09:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:09:48,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:48,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:48,336 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 14:09:48,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:48,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578706794] [2019-12-07 14:09:48,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:48,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578706794] [2019-12-07 14:09:48,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:48,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:09:48,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244243399] [2019-12-07 14:09:48,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:09:48,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:09:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:09:48,379 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 14:09:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:48,703 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 14:09:48,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:09:48,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:09:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:48,801 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 14:09:48,801 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 14:09:48,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:09:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 14:09:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 14:09:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 14:09:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 14:09:49,983 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 14:09:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:49,984 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 14:09:49,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:09:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 14:09:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:09:49,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:49,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:49,987 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-07 14:09:49,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:49,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105972588] [2019-12-07 14:09:49,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:50,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105972588] [2019-12-07 14:09:50,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:50,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:09:50,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814451911] [2019-12-07 14:09:50,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:09:50,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:09:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:50,018 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 14:09:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:50,312 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 14:09:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:09:50,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 14:09:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:50,450 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 14:09:50,451 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 14:09:50,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 14:09:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 14:09:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 14:09:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 14:09:53,395 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 14:09:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:53,395 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 14:09:53,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:09:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 14:09:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:09:53,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:53,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:53,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1557518127, now seen corresponding path program 1 times [2019-12-07 14:09:53,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:53,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310999631] [2019-12-07 14:09:53,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:53,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310999631] [2019-12-07 14:09:53,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:53,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:09:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333684139] [2019-12-07 14:09:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:09:53,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:09:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:53,441 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 14:09:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:53,672 INFO L93 Difference]: Finished difference Result 74579 states and 241156 transitions. [2019-12-07 14:09:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:09:53,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:09:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:53,795 INFO L225 Difference]: With dead ends: 74579 [2019-12-07 14:09:53,795 INFO L226 Difference]: Without dead ends: 74579 [2019-12-07 14:09:53,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74579 states. [2019-12-07 14:09:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74579 to 74379. [2019-12-07 14:09:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74379 states. [2019-12-07 14:09:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74379 states to 74379 states and 240564 transitions. [2019-12-07 14:09:55,323 INFO L78 Accepts]: Start accepts. Automaton has 74379 states and 240564 transitions. Word has length 16 [2019-12-07 14:09:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:55,324 INFO L462 AbstractCegarLoop]: Abstraction has 74379 states and 240564 transitions. [2019-12-07 14:09:55,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:09:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 74379 states and 240564 transitions. [2019-12-07 14:09:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:09:55,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:55,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:55,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1018520364, now seen corresponding path program 1 times [2019-12-07 14:09:55,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:55,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751885898] [2019-12-07 14:09:55,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:55,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751885898] [2019-12-07 14:09:55,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:55,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:09:55,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846063103] [2019-12-07 14:09:55,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:09:55,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:09:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:55,385 INFO L87 Difference]: Start difference. First operand 74379 states and 240564 transitions. Second operand 3 states. [2019-12-07 14:09:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:55,624 INFO L93 Difference]: Finished difference Result 74400 states and 240474 transitions. [2019-12-07 14:09:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:09:55,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:09:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:55,749 INFO L225 Difference]: With dead ends: 74400 [2019-12-07 14:09:55,750 INFO L226 Difference]: Without dead ends: 74400 [2019-12-07 14:09:55,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:09:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74400 states. [2019-12-07 14:09:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74400 to 74308. [2019-12-07 14:09:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 14:09:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 14:09:57,409 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 16 [2019-12-07 14:09:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:57,409 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 14:09:57,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:09:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 14:09:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:09:57,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:57,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:57,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1509366251, now seen corresponding path program 1 times [2019-12-07 14:09:57,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:57,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132023526] [2019-12-07 14:09:57,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132023526] [2019-12-07 14:09:57,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:57,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:09:57,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863996723] [2019-12-07 14:09:57,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:09:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:09:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:09:57,457 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 4 states. [2019-12-07 14:09:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:57,693 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 14:09:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:09:57,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 14:09:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:57,805 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 14:09:57,805 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 14:09:57,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:09:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 14:09:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 14:09:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 14:09:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 14:09:59,385 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 14:09:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:09:59,385 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 14:09:59,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:09:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 14:09:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:09:59,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:09:59,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:09:59,389 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:09:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:09:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-07 14:09:59,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:09:59,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796219845] [2019-12-07 14:09:59,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:09:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:09:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:09:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796219845] [2019-12-07 14:09:59,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:09:59,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:09:59,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551311471] [2019-12-07 14:09:59,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:09:59,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:09:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:09:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:09:59,417 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 14:09:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:09:59,842 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 14:09:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:09:59,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 14:09:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:09:59,977 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 14:09:59,977 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 14:09:59,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 14:10:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 14:10:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 14:10:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 14:10:01,610 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 14:10:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:01,611 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 14:10:01,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 14:10:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:10:01,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:01,617 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] [2019-12-07 14:10:01,617 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1669716828, now seen corresponding path program 1 times [2019-12-07 14:10:01,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:01,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368360748] [2019-12-07 14:10:01,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:01,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368360748] [2019-12-07 14:10:01,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:01,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:10:01,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674228164] [2019-12-07 14:10:01,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:01,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:01,642 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 14:10:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:01,661 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 14:10:01,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:01,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:10:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:01,667 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 14:10:01,667 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 14:10:01,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 14:10:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 14:10:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 14:10:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 14:10:01,742 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 14:10:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:01,742 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 14:10:01,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 14:10:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:10:01,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:01,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:01,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-07 14:10:01,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:01,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274439720] [2019-12-07 14:10:01,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:01,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274439720] [2019-12-07 14:10:01,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:01,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:01,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605802298] [2019-12-07 14:10:01,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:10:01,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:10:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:01,791 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 14:10:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:02,152 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 14:10:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:10:02,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:10:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:02,158 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 14:10:02,158 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 14:10:02,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 14:10:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 14:10:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 14:10:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 14:10:02,243 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 14:10:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:02,243 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 14:10:02,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:10:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 14:10:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:10:02,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:02,247 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] [2019-12-07 14:10:02,247 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-07 14:10:02,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:02,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751346489] [2019-12-07 14:10:02,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:02,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751346489] [2019-12-07 14:10:02,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:02,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:02,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654444793] [2019-12-07 14:10:02,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:02,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:02,273 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 14:10:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:02,323 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 14:10:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:02,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 14:10:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:02,329 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 14:10:02,329 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 14:10:02,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 14:10:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 14:10:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 14:10:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 14:10:02,405 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 14:10:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:02,405 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 14:10:02,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 14:10:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:10:02,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:02,409 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] [2019-12-07 14:10:02,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-07 14:10:02,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:02,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807475078] [2019-12-07 14:10:02,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:02,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807475078] [2019-12-07 14:10:02,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:02,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:02,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545608037] [2019-12-07 14:10:02,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:10:02,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:10:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:02,452 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 14:10:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:02,696 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 14:10:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:10:02,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 14:10:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:02,703 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 14:10:02,703 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 14:10:02,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 14:10:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 14:10:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 14:10:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 14:10:02,776 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 14:10:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:02,776 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 14:10:02,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:10:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 14:10:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:10:02,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:02,781 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] [2019-12-07 14:10:02,781 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-07 14:10:02,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:02,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556426945] [2019-12-07 14:10:02,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:02,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556426945] [2019-12-07 14:10:02,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:02,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:02,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932527686] [2019-12-07 14:10:02,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:02,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:02,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:02,814 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 4 states. [2019-12-07 14:10:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:02,830 INFO L93 Difference]: Finished difference Result 5076 states and 11212 transitions. [2019-12-07 14:10:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:10:02,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 14:10:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:02,834 INFO L225 Difference]: With dead ends: 5076 [2019-12-07 14:10:02,834 INFO L226 Difference]: Without dead ends: 5076 [2019-12-07 14:10:02,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2019-12-07 14:10:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5076. [2019-12-07 14:10:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-12-07 14:10:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 11212 transitions. [2019-12-07 14:10:02,877 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 11212 transitions. Word has length 39 [2019-12-07 14:10:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:02,877 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 11212 transitions. [2019-12-07 14:10:02,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 11212 transitions. [2019-12-07 14:10:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:10:02,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:02,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:02,883 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash 43265710, now seen corresponding path program 1 times [2019-12-07 14:10:02,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:02,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34341974] [2019-12-07 14:10:02,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:02,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34341974] [2019-12-07 14:10:02,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:02,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:02,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406475117] [2019-12-07 14:10:02,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:02,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:02,926 INFO L87 Difference]: Start difference. First operand 5076 states and 11212 transitions. Second operand 4 states. [2019-12-07 14:10:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:02,983 INFO L93 Difference]: Finished difference Result 6319 states and 13852 transitions. [2019-12-07 14:10:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:10:02,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 14:10:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:02,988 INFO L225 Difference]: With dead ends: 6319 [2019-12-07 14:10:02,988 INFO L226 Difference]: Without dead ends: 6319 [2019-12-07 14:10:02,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6319 states. [2019-12-07 14:10:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6319 to 5453. [2019-12-07 14:10:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-12-07 14:10:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12056 transitions. [2019-12-07 14:10:03,043 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12056 transitions. Word has length 69 [2019-12-07 14:10:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:03,043 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 12056 transitions. [2019-12-07 14:10:03,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12056 transitions. [2019-12-07 14:10:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:10:03,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:03,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:03,049 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964716, now seen corresponding path program 1 times [2019-12-07 14:10:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:03,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027303625] [2019-12-07 14:10:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027303625] [2019-12-07 14:10:03,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:03,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:10:03,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512474302] [2019-12-07 14:10:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:03,102 INFO L87 Difference]: Start difference. First operand 5453 states and 12056 transitions. Second operand 4 states. [2019-12-07 14:10:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:03,253 INFO L93 Difference]: Finished difference Result 6362 states and 13878 transitions. [2019-12-07 14:10:03,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:10:03,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 14:10:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:03,258 INFO L225 Difference]: With dead ends: 6362 [2019-12-07 14:10:03,258 INFO L226 Difference]: Without dead ends: 6362 [2019-12-07 14:10:03,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6362 states. [2019-12-07 14:10:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6362 to 6062. [2019-12-07 14:10:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6062 states. [2019-12-07 14:10:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 13252 transitions. [2019-12-07 14:10:03,312 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 13252 transitions. Word has length 70 [2019-12-07 14:10:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:03,312 INFO L462 AbstractCegarLoop]: Abstraction has 6062 states and 13252 transitions. [2019-12-07 14:10:03,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 13252 transitions. [2019-12-07 14:10:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:10:03,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:03,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:03,319 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1570353220, now seen corresponding path program 2 times [2019-12-07 14:10:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781883825] [2019-12-07 14:10:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:03,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781883825] [2019-12-07 14:10:03,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:03,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:10:03,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039102224] [2019-12-07 14:10:03,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:10:03,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:10:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:10:03,405 INFO L87 Difference]: Start difference. First operand 6062 states and 13252 transitions. Second operand 8 states. [2019-12-07 14:10:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:03,708 INFO L93 Difference]: Finished difference Result 10490 states and 22798 transitions. [2019-12-07 14:10:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:10:03,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-07 14:10:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:03,714 INFO L225 Difference]: With dead ends: 10490 [2019-12-07 14:10:03,715 INFO L226 Difference]: Without dead ends: 9700 [2019-12-07 14:10:03,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:10:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9700 states. [2019-12-07 14:10:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9700 to 7380. [2019-12-07 14:10:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7380 states. [2019-12-07 14:10:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7380 states to 7380 states and 16325 transitions. [2019-12-07 14:10:03,795 INFO L78 Accepts]: Start accepts. Automaton has 7380 states and 16325 transitions. Word has length 70 [2019-12-07 14:10:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:03,795 INFO L462 AbstractCegarLoop]: Abstraction has 7380 states and 16325 transitions. [2019-12-07 14:10:03,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:10:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7380 states and 16325 transitions. [2019-12-07 14:10:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:10:03,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:03,803 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 22890042, now seen corresponding path program 3 times [2019-12-07 14:10:03,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:03,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708895259] [2019-12-07 14:10:03,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:03,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708895259] [2019-12-07 14:10:03,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:03,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:03,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209761561] [2019-12-07 14:10:03,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:03,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:03,847 INFO L87 Difference]: Start difference. First operand 7380 states and 16325 transitions. Second operand 4 states. [2019-12-07 14:10:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:03,869 INFO L93 Difference]: Finished difference Result 8109 states and 17880 transitions. [2019-12-07 14:10:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:10:03,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 14:10:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:03,871 INFO L225 Difference]: With dead ends: 8109 [2019-12-07 14:10:03,871 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 14:10:03,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 14:10:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2019-12-07 14:10:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-12-07 14:10:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1845 transitions. [2019-12-07 14:10:03,878 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1845 transitions. Word has length 70 [2019-12-07 14:10:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:03,878 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1845 transitions. [2019-12-07 14:10:03,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1845 transitions. [2019-12-07 14:10:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:10:03,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:03,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:03,879 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1426698558, now seen corresponding path program 1 times [2019-12-07 14:10:03,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:03,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607640227] [2019-12-07 14:10:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:03,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607640227] [2019-12-07 14:10:03,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:03,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:10:03,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173011067] [2019-12-07 14:10:03,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:10:03,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:10:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:10:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:10:03,938 INFO L87 Difference]: Start difference. First operand 891 states and 1845 transitions. Second operand 8 states. [2019-12-07 14:10:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:04,079 INFO L93 Difference]: Finished difference Result 1714 states and 3454 transitions. [2019-12-07 14:10:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:10:04,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 14:10:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:04,081 INFO L225 Difference]: With dead ends: 1714 [2019-12-07 14:10:04,081 INFO L226 Difference]: Without dead ends: 1263 [2019-12-07 14:10:04,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:10:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-07 14:10:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 923. [2019-12-07 14:10:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 14:10:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1905 transitions. [2019-12-07 14:10:04,090 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1905 transitions. Word has length 71 [2019-12-07 14:10:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:04,090 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1905 transitions. [2019-12-07 14:10:04,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:10:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1905 transitions. [2019-12-07 14:10:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:10:04,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:04,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:04,091 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 2 times [2019-12-07 14:10:04,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:10:04,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401155782] [2019-12-07 14:10:04,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:10:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:10:04,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:10:04,171 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:10:04,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t10~0.base_51|) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t10~0.base_51| 4)) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= 0 |v_ULTIMATE.start_main_~#t10~0.offset_32|) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t10~0.base_51|) 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_51|) |v_ULTIMATE.start_main_~#t10~0.offset_32| 0)) |v_#memory_int_17|) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= (store .cse0 |v_ULTIMATE.start_main_~#t10~0.base_51| 1) |v_#valid_74|) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} 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_997, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_23|, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t10~0.base=|v_ULTIMATE.start_main_~#t10~0.base_51|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t10~0.offset=|v_ULTIMATE.start_main_~#t10~0.offset_32|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t11~0.base, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t10~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t10~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:10:04,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t11~0.offset_10| 0) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t11~0.base_11| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11|) |v_ULTIMATE.start_main_~#t11~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t11~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t11~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t11~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset] because there is no mapped edge [2019-12-07 14:10:04,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= |P0Thread1of1ForFork1_#t~nondet3_In1033192189| ~weak$$choice0~0_Out1033192189) (= ~y~0_In1033192189 ~y$mem_tmp~0_Out1033192189) (= ~weak$$choice2~0_Out1033192189 ~y$flush_delayed~0_Out1033192189) (= ~y$r_buff1_thd2~0_Out1033192189 ~y$r_buff0_thd2~0_In1033192189) (= ~weak$$choice2~0_Out1033192189 |P0Thread1of1ForFork1_#t~nondet4_In1033192189|) (= 1 ~y$r_buff0_thd1~0_Out1033192189) (= ~y$r_buff1_thd1~0_Out1033192189 ~y$r_buff0_thd1~0_In1033192189) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189 0)) (= ~y$r_buff1_thd0~0_Out1033192189 ~y$r_buff0_thd0~0_In1033192189)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033192189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1033192189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1033192189|, ~y~0=~y~0_In1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1033192189|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1033192189, ~weak$$choice0~0=~weak$$choice0~0_Out1033192189, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1033192189, ~y$mem_tmp~0=~y$mem_tmp~0_Out1033192189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033192189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1033192189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1033192189, ~y$flush_delayed~0=~y$flush_delayed~0_Out1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1033192189|, ~y~0=~y~0_In1033192189, ~weak$$choice2~0=~weak$$choice2~0_Out1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1033192189|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1033192189} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:10:04,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| |P0Thread1of1ForFork1_#t~ite6_Out-132833882|)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-132833882 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-132833882 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| ~y$w_buff0~0_In-132833882) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| ~y$w_buff1~0_In-132833882) .cse2 (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-132833882, ~y$w_buff1~0=~y$w_buff1~0_In-132833882, ~y$w_buff0~0=~y$w_buff0~0_In-132833882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-132833882} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-132833882|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-132833882, ~y$w_buff1~0=~y$w_buff1~0_In-132833882, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-132833882|, ~y$w_buff0~0=~y$w_buff0~0_In-132833882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-132833882} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 14:10:04,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:10:04,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1491489486 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out-1491489486| ~y~0_In-1491489486)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out-1491489486| ~y$mem_tmp~0_In-1491489486)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1491489486, ~y$flush_delayed~0=~y$flush_delayed~0_In-1491489486, ~y~0=~y~0_In-1491489486} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1491489486, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1491489486|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1491489486, ~y~0=~y~0_In-1491489486} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:10:04,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1881336340 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-1881336340| ~y~0_In-1881336340)) (and (not .cse0) (= ~y$mem_tmp~0_In-1881336340 |P1Thread1of1ForFork0_#t~ite54_Out-1881336340|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1881336340, ~y$flush_delayed~0=~y$flush_delayed~0_In-1881336340, ~y~0=~y~0_In-1881336340} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1881336340, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1881336340|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1881336340, ~y~0=~y~0_In-1881336340} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:10:04,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2009807058 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2009807058 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-2009807058| ~y$w_buff0_used~0_In-2009807058) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out-2009807058| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009807058, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009807058} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009807058, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-2009807058|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009807058} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:10:04,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-381169206 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-381169206 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-381169206 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-381169206 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-381169206|)) (and (= ~y$w_buff1_used~0_In-381169206 |P0Thread1of1ForFork1_#t~ite29_Out-381169206|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381169206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381169206, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381169206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381169206} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381169206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381169206, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-381169206|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381169206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381169206} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:10:04,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1733910699 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1733910699 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1733910699 ~y$r_buff0_thd1~0_In1733910699))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1733910699)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1733910699, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1733910699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1733910699, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1733910699, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1733910699|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:10:04,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1828479461 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1828479461 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1828479461 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1828479461 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1828479461 |P0Thread1of1ForFork1_#t~ite31_Out-1828479461|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1828479461|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1828479461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1828479461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1828479461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1828479461} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1828479461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1828479461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1828479461, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1828479461|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1828479461} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:10:04,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:10:04,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1182454857 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1182454857 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1182454857| ~y$w_buff1~0_In-1182454857) (not .cse0) (not .cse1)) (and (= ~y~0_In-1182454857 |P1Thread1of1ForFork0_#t~ite55_Out-1182454857|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182454857, ~y$w_buff1~0=~y$w_buff1~0_In-1182454857, ~y~0=~y~0_In-1182454857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182454857} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182454857, ~y$w_buff1~0=~y$w_buff1~0_In-1182454857, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1182454857|, ~y~0=~y~0_In-1182454857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182454857} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 14:10:04,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 14:10:04,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2128011654 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2128011654 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2128011654 |P1Thread1of1ForFork0_#t~ite57_Out-2128011654|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-2128011654|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128011654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128011654} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128011654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128011654, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-2128011654|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 14:10:04,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1042937852 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1042937852 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1042937852 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1042937852 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out1042937852|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite58_Out1042937852| ~y$w_buff1_used~0_In1042937852) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1042937852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1042937852, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1042937852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042937852} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1042937852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1042937852, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1042937852, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1042937852|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042937852} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 14:10:04,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In712050203 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In712050203 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out712050203|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In712050203 |P1Thread1of1ForFork0_#t~ite59_Out712050203|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In712050203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712050203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In712050203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712050203, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out712050203|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 14:10:04,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1690457180 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1690457180 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1690457180 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1690457180 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1690457180| ~y$r_buff1_thd2~0_In-1690457180)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-1690457180| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690457180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690457180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690457180, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690457180} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690457180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690457180, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1690457180|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690457180, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690457180} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 14:10:04,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:10:04,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:10:04,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In160070674 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In160070674 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite64_Out160070674| |ULTIMATE.start_main_#t~ite63_Out160070674|))) (or (and (or .cse0 .cse1) (= ~y~0_In160070674 |ULTIMATE.start_main_#t~ite63_Out160070674|) .cse2) (and (= ~y$w_buff1~0_In160070674 |ULTIMATE.start_main_#t~ite63_Out160070674|) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In160070674, ~y~0=~y~0_In160070674, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160070674, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160070674} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out160070674|, ~y$w_buff1~0=~y$w_buff1~0_In160070674, ~y~0=~y~0_In160070674, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160070674, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out160070674|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160070674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:10:04,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1978427780 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1978427780 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1978427780 |ULTIMATE.start_main_#t~ite65_Out1978427780|)) (and (= |ULTIMATE.start_main_#t~ite65_Out1978427780| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1978427780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1978427780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1978427780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1978427780, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1978427780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:10:04,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1113154211 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1113154211 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1113154211 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1113154211 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out1113154211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1113154211 |ULTIMATE.start_main_#t~ite66_Out1113154211|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1113154211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1113154211, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1113154211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113154211} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1113154211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1113154211, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1113154211|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1113154211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113154211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:10:04,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1286166015 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1286166015 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1286166015 |ULTIMATE.start_main_#t~ite67_Out1286166015|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1286166015|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1286166015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1286166015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1286166015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1286166015, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1286166015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:10:04,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-862769281 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-862769281 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-862769281 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-862769281 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-862769281| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite68_Out-862769281| ~y$r_buff1_thd0~0_In-862769281) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-862769281, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862769281, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-862769281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-862769281} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-862769281, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862769281, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-862769281|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-862769281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-862769281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:10:04,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:10:04,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:10:04 BasicIcfg [2019-12-07 14:10:04,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:10:04,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:10:04,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:10:04,240 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:10:04,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:09:39" (3/4) ... [2019-12-07 14:10:04,242 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:10:04,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t10~0.base_51|) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t10~0.base_51| 4)) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= 0 |v_ULTIMATE.start_main_~#t10~0.offset_32|) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t10~0.base_51|) 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_51|) |v_ULTIMATE.start_main_~#t10~0.offset_32| 0)) |v_#memory_int_17|) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= (store .cse0 |v_ULTIMATE.start_main_~#t10~0.base_51| 1) |v_#valid_74|) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} 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_997, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_23|, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t10~0.base=|v_ULTIMATE.start_main_~#t10~0.base_51|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t10~0.offset=|v_ULTIMATE.start_main_~#t10~0.offset_32|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t11~0.base, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t10~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t10~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:10:04,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t11~0.offset_10| 0) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t11~0.base_11| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11|) |v_ULTIMATE.start_main_~#t11~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t11~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t11~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t11~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset] because there is no mapped edge [2019-12-07 14:10:04,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= |P0Thread1of1ForFork1_#t~nondet3_In1033192189| ~weak$$choice0~0_Out1033192189) (= ~y~0_In1033192189 ~y$mem_tmp~0_Out1033192189) (= ~weak$$choice2~0_Out1033192189 ~y$flush_delayed~0_Out1033192189) (= ~y$r_buff1_thd2~0_Out1033192189 ~y$r_buff0_thd2~0_In1033192189) (= ~weak$$choice2~0_Out1033192189 |P0Thread1of1ForFork1_#t~nondet4_In1033192189|) (= 1 ~y$r_buff0_thd1~0_Out1033192189) (= ~y$r_buff1_thd1~0_Out1033192189 ~y$r_buff0_thd1~0_In1033192189) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189 0)) (= ~y$r_buff1_thd0~0_Out1033192189 ~y$r_buff0_thd0~0_In1033192189)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033192189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1033192189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1033192189|, ~y~0=~y~0_In1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1033192189|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1033192189, ~weak$$choice0~0=~weak$$choice0~0_Out1033192189, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1033192189, ~y$mem_tmp~0=~y$mem_tmp~0_Out1033192189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1033192189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1033192189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1033192189, ~y$flush_delayed~0=~y$flush_delayed~0_Out1033192189, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1033192189, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1033192189|, ~y~0=~y~0_In1033192189, ~weak$$choice2~0=~weak$$choice2~0_Out1033192189, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1033192189|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1033192189} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:10:04,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| |P0Thread1of1ForFork1_#t~ite6_Out-132833882|)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-132833882 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-132833882 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| ~y$w_buff0~0_In-132833882) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-132833882| ~y$w_buff1~0_In-132833882) .cse2 (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-132833882, ~y$w_buff1~0=~y$w_buff1~0_In-132833882, ~y$w_buff0~0=~y$w_buff0~0_In-132833882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-132833882} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-132833882|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-132833882, ~y$w_buff1~0=~y$w_buff1~0_In-132833882, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-132833882|, ~y$w_buff0~0=~y$w_buff0~0_In-132833882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-132833882} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 14:10:04,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:10:04,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1491489486 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out-1491489486| ~y~0_In-1491489486)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out-1491489486| ~y$mem_tmp~0_In-1491489486)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1491489486, ~y$flush_delayed~0=~y$flush_delayed~0_In-1491489486, ~y~0=~y~0_In-1491489486} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1491489486, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1491489486|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1491489486, ~y~0=~y~0_In-1491489486} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:10:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1881336340 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-1881336340| ~y~0_In-1881336340)) (and (not .cse0) (= ~y$mem_tmp~0_In-1881336340 |P1Thread1of1ForFork0_#t~ite54_Out-1881336340|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1881336340, ~y$flush_delayed~0=~y$flush_delayed~0_In-1881336340, ~y~0=~y~0_In-1881336340} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1881336340, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1881336340|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1881336340, ~y~0=~y~0_In-1881336340} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 14:10:04,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2009807058 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2009807058 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-2009807058| ~y$w_buff0_used~0_In-2009807058) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out-2009807058| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009807058, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009807058} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009807058, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-2009807058|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009807058} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 14:10:04,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-381169206 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-381169206 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-381169206 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-381169206 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-381169206|)) (and (= ~y$w_buff1_used~0_In-381169206 |P0Thread1of1ForFork1_#t~ite29_Out-381169206|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381169206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381169206, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381169206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381169206} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381169206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381169206, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-381169206|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381169206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381169206} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 14:10:04,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1733910699 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1733910699 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1733910699 ~y$r_buff0_thd1~0_In1733910699))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1733910699)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1733910699, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1733910699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1733910699, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1733910699, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1733910699|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:10:04,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1828479461 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1828479461 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1828479461 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1828479461 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1828479461 |P0Thread1of1ForFork1_#t~ite31_Out-1828479461|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1828479461|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1828479461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1828479461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1828479461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1828479461} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1828479461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1828479461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1828479461, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1828479461|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1828479461} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:10:04,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:10:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1182454857 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1182454857 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1182454857| ~y$w_buff1~0_In-1182454857) (not .cse0) (not .cse1)) (and (= ~y~0_In-1182454857 |P1Thread1of1ForFork0_#t~ite55_Out-1182454857|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182454857, ~y$w_buff1~0=~y$w_buff1~0_In-1182454857, ~y~0=~y~0_In-1182454857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182454857} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1182454857, ~y$w_buff1~0=~y$w_buff1~0_In-1182454857, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1182454857|, ~y~0=~y~0_In-1182454857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1182454857} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 14:10:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 14:10:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2128011654 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2128011654 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2128011654 |P1Thread1of1ForFork0_#t~ite57_Out-2128011654|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-2128011654|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128011654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128011654} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128011654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128011654, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-2128011654|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 14:10:04,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1042937852 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1042937852 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1042937852 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1042937852 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out1042937852|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite58_Out1042937852| ~y$w_buff1_used~0_In1042937852) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1042937852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1042937852, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1042937852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042937852} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1042937852, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1042937852, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1042937852, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1042937852|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042937852} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 14:10:04,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In712050203 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In712050203 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out712050203|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In712050203 |P1Thread1of1ForFork0_#t~ite59_Out712050203|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In712050203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712050203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In712050203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In712050203, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out712050203|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 14:10:04,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1690457180 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1690457180 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1690457180 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1690457180 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1690457180| ~y$r_buff1_thd2~0_In-1690457180)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-1690457180| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690457180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690457180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690457180, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690457180} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1690457180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1690457180, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1690457180|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1690457180, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1690457180} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 14:10:04,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:10:04,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:10:04,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In160070674 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In160070674 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite64_Out160070674| |ULTIMATE.start_main_#t~ite63_Out160070674|))) (or (and (or .cse0 .cse1) (= ~y~0_In160070674 |ULTIMATE.start_main_#t~ite63_Out160070674|) .cse2) (and (= ~y$w_buff1~0_In160070674 |ULTIMATE.start_main_#t~ite63_Out160070674|) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In160070674, ~y~0=~y~0_In160070674, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160070674, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160070674} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out160070674|, ~y$w_buff1~0=~y$w_buff1~0_In160070674, ~y~0=~y~0_In160070674, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160070674, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out160070674|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160070674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:10:04,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1978427780 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1978427780 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1978427780 |ULTIMATE.start_main_#t~ite65_Out1978427780|)) (and (= |ULTIMATE.start_main_#t~ite65_Out1978427780| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1978427780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1978427780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1978427780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1978427780, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1978427780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 14:10:04,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1113154211 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1113154211 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1113154211 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1113154211 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out1113154211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1113154211 |ULTIMATE.start_main_#t~ite66_Out1113154211|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1113154211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1113154211, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1113154211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113154211} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1113154211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1113154211, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1113154211|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1113154211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1113154211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 14:10:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1286166015 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1286166015 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1286166015 |ULTIMATE.start_main_#t~ite67_Out1286166015|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1286166015|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1286166015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1286166015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1286166015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1286166015, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1286166015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 14:10:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-862769281 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-862769281 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-862769281 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-862769281 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-862769281| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite68_Out-862769281| ~y$r_buff1_thd0~0_In-862769281) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-862769281, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862769281, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-862769281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-862769281} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-862769281, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-862769281, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-862769281|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-862769281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-862769281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:10:04,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:10:04,311 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0620a580-a703-4a6e-956b-b24bec7792a0/bin/uautomizer/witness.graphml [2019-12-07 14:10:04,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:10:04,312 INFO L168 Benchmark]: Toolchain (without parser) took 25713.52 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 937.9 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,313 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:10:04,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:10:04,313 INFO L168 Benchmark]: Boogie Preprocessor took 28.01 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,314 INFO L168 Benchmark]: RCFGBuilder took 460.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.2 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,314 INFO L168 Benchmark]: TraceAbstraction took 24710.38 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 994.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,314 INFO L168 Benchmark]: Witness Printer took 71.90 ms. Allocated memory is still 3.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:10:04,316 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.19 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 28.01 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 460.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.2 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24710.38 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 994.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 71.90 ms. Allocated memory is still 3.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t10, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L820] FCALL, FORK 0 pthread_create(&t11, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, 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] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, 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] [L759] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, 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] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L783] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L783] 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) [L784] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_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))=1, x=1, 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] [L784] 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)) [L785] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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))=0, x=1, 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] [L785] 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)) [L786] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_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))=1, x=1, 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] [L786] 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)) [L787] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_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=1, 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] [L787] 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)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, 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] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_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))=0, x=1, 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] [L789] 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)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L759] 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) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=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] [L795] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=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] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 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, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3873 SDtfs, 3117 SDslu, 6872 SDs, 0 SdLazy, 2182 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 39726 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 590 ConstructedInterpolants, 0 QuantifiedInterpolants, 101098 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...