./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/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 a87dd4f5289dff1371a422fc1d6a7a610a0f8c3a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:41:31,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:41:31,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:41:31,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:41:31,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:41:31,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:41:31,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:41:31,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:41:31,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:41:31,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:41:31,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:41:31,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:41:31,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:41:31,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:41:31,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:41:31,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:41:31,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:41:31,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:41:31,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:41:31,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:41:31,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:41:31,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:41:31,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:41:31,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:41:31,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:41:31,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:41:31,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:41:31,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:41:31,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:41:31,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:41:31,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:41:31,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:41:31,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:41:31,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:41:31,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:41:31,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:41:31,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:41:31,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:41:31,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:41:31,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:41:31,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:41:31,962 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:41:31,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:41:31,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:41:31,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:41:31,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:41:31,976 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:41:31,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:41:31,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:41:31,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:41:31,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:41:31,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:41:31,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:41:31,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:41:31,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:41:31,978 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:41:31,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:41:31,978 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:41:31,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:41:31,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:41:31,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:41:31,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:41:31,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:41:31,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:41:31,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:41:31,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:41:31,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:41:31,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:41:31,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:41:31,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:41:31,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:41:31,981 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_b787f4e0-d822-4cbb-a2b2-2b750b021a97/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 -> a87dd4f5289dff1371a422fc1d6a7a610a0f8c3a [2019-12-07 12:41:32,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:41:32,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:41:32,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:41:32,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:41:32,092 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:41:32,092 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_power.opt.i [2019-12-07 12:41:32,129 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/data/29e4d84b7/db515adff3604d92900ebfe3ac5aa7d5/FLAG3ba3def14 [2019-12-07 12:41:32,511 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:41:32,512 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/sv-benchmarks/c/pthread-wmm/rfi008_power.opt.i [2019-12-07 12:41:32,521 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/data/29e4d84b7/db515adff3604d92900ebfe3ac5aa7d5/FLAG3ba3def14 [2019-12-07 12:41:32,530 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/data/29e4d84b7/db515adff3604d92900ebfe3ac5aa7d5 [2019-12-07 12:41:32,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:41:32,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:41:32,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:41:32,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:41:32,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:41:32,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:32,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32, skipping insertion in model container [2019-12-07 12:41:32,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:32,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:41:32,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:41:32,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:41:32,880 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:41:32,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:41:32,991 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:41:32,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32 WrapperNode [2019-12-07 12:41:32,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:41:32,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:41:32,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:41:32,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:41:32,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 12:41:32" (1/1) ... [2019-12-07 12:41:33,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:41:33,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:41:33,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:41:33,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:41:33,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... [2019-12-07 12:41:33,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:41:33,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:41:33,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:41:33,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:41:33,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/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 12:41:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:41:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:41:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:41:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:41:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:41:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:41:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:41:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:41:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:41:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:41:33,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:41:33,106 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 12:41:33,495 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:41:33,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:41:33,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:41:33 BoogieIcfgContainer [2019-12-07 12:41:33,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:41:33,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:41:33,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:41:33,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:41:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:41:32" (1/3) ... [2019-12-07 12:41:33,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9c5679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:41:33, skipping insertion in model container [2019-12-07 12:41:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:41:32" (2/3) ... [2019-12-07 12:41:33,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9c5679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:41:33, skipping insertion in model container [2019-12-07 12:41:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:41:33" (3/3) ... [2019-12-07 12:41:33,501 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-07 12:41:33,507 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:41:33,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:41:33,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:41:33,512 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:41:33,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:41:33,573 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:41:33,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:41:33,585 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:41:33,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:41:33,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:41:33,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:41:33,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:41:33,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:41:33,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:41:33,597 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 12:41:33,598 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:41:33,655 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:41:33,656 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:41:33,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:41:33,686 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:41:33,719 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:41:33,719 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:41:33,726 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:41:33,748 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 12:41:33,749 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:41:36,474 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 12:41:36,631 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:41:36,739 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-07 12:41:36,739 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 12:41:36,742 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-07 12:41:37,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-07 12:41:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-07 12:41:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:41:37,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:37,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:41:37,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-07 12:41:37,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:37,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390699862] [2019-12-07 12:41:37,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:41:38,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390699862] [2019-12-07 12:41:38,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:38,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:41:38,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670825161] [2019-12-07 12:41:38,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:38,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:38,126 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-07 12:41:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:38,411 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-07 12:41:38,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:38,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:41:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:38,573 INFO L225 Difference]: With dead ends: 25080 [2019-12-07 12:41:38,574 INFO L226 Difference]: Without dead ends: 23470 [2019-12-07 12:41:38,575 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 12:41:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-07 12:41:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-07 12:41:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-07 12:41:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-07 12:41:39,589 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-07 12:41:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:39,589 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-07 12:41:39,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-07 12:41:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:41:39,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:39,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:39,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-07 12:41:39,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:39,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583936849] [2019-12-07 12:41:39,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:39,650 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 12:41:39,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583936849] [2019-12-07 12:41:39,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:39,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:39,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414218458] [2019-12-07 12:41:39,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:39,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:39,652 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-07 12:41:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:40,014 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-07 12:41:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:40,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:41:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:40,170 INFO L225 Difference]: With dead ends: 36446 [2019-12-07 12:41:40,170 INFO L226 Difference]: Without dead ends: 36430 [2019-12-07 12:41:40,171 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 12:41:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-07 12:41:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-07 12:41:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-07 12:41:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-07 12:41:41,144 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-07 12:41:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:41,144 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-07 12:41:41,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-07 12:41:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:41:41,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:41,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:41,147 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-07 12:41:41,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:41,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476856247] [2019-12-07 12:41:41,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:41,191 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 12:41:41,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476856247] [2019-12-07 12:41:41,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:41,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:41,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091892318] [2019-12-07 12:41:41,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:41,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:41,192 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-12-07 12:41:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:41,483 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-07 12:41:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:41,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:41:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:41,563 INFO L225 Difference]: With dead ends: 46394 [2019-12-07 12:41:41,563 INFO L226 Difference]: Without dead ends: 46379 [2019-12-07 12:41:41,563 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 12:41:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-07 12:41:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-07 12:41:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-07 12:41:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-07 12:41:42,723 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-07 12:41:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:42,724 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-07 12:41:42,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-07 12:41:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:41:42,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:42,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:42,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-07 12:41:42,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:42,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751098979] [2019-12-07 12:41:42,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:42,762 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 12:41:42,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751098979] [2019-12-07 12:41:42,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:42,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:42,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150786193] [2019-12-07 12:41:42,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:42,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:42,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:42,764 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-12-07 12:41:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:43,022 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-07 12:41:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:43,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:41:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:43,147 INFO L225 Difference]: With dead ends: 67890 [2019-12-07 12:41:43,147 INFO L226 Difference]: Without dead ends: 67890 [2019-12-07 12:41:43,148 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 12:41:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-07 12:41:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-07 12:41:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-07 12:41:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-07 12:41:44,567 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-07 12:41:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:44,567 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-07 12:41:44,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-07 12:41:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:41:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:44,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:44,572 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-07 12:41:44,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:44,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550425438] [2019-12-07 12:41:44,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:41:44,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550425438] [2019-12-07 12:41:44,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:44,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:44,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058403382] [2019-12-07 12:41:44,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:44,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:44,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:44,633 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 4 states. [2019-12-07 12:41:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:44,672 INFO L93 Difference]: Finished difference Result 9507 states and 25746 transitions. [2019-12-07 12:41:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:41:44,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:41:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:44,678 INFO L225 Difference]: With dead ends: 9507 [2019-12-07 12:41:44,678 INFO L226 Difference]: Without dead ends: 5931 [2019-12-07 12:41:44,678 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 12:41:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-12-07 12:41:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5931. [2019-12-07 12:41:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-07 12:41:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-12-07 12:41:44,732 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 16 [2019-12-07 12:41:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:44,732 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-12-07 12:41:44,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-12-07 12:41:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:41:44,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:44,734 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 12:41:44,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-07 12:41:44,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:44,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805383103] [2019-12-07 12:41:44,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:44,764 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 12:41:44,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805383103] [2019-12-07 12:41:44,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:44,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:44,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098433170] [2019-12-07 12:41:44,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:44,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:44,766 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-12-07 12:41:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:44,929 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-12-07 12:41:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:44,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:41:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:44,935 INFO L225 Difference]: With dead ends: 7446 [2019-12-07 12:41:44,935 INFO L226 Difference]: Without dead ends: 7418 [2019-12-07 12:41:44,935 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 12:41:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-07 12:41:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-12-07 12:41:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-12-07 12:41:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-12-07 12:41:44,995 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-12-07 12:41:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:44,995 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-12-07 12:41:44,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-12-07 12:41:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:41:44,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:44,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:44,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-12-07 12:41:44,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:44,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193006731] [2019-12-07 12:41:44,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:45,060 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 12:41:45,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193006731] [2019-12-07 12:41:45,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:45,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:45,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834313823] [2019-12-07 12:41:45,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:45,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:45,062 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-12-07 12:41:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:45,303 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-12-07 12:41:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:41:45,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:41:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:45,310 INFO L225 Difference]: With dead ends: 8033 [2019-12-07 12:41:45,310 INFO L226 Difference]: Without dead ends: 8032 [2019-12-07 12:41:45,311 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 12:41:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-12-07 12:41:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-12-07 12:41:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-12-07 12:41:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-12-07 12:41:45,391 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-12-07 12:41:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-12-07 12:41:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-12-07 12:41:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:41:45,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:45,396 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] [2019-12-07 12:41:45,396 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-12-07 12:41:45,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:45,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161582021] [2019-12-07 12:41:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:45,421 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 12:41:45,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161582021] [2019-12-07 12:41:45,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:45,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:45,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490070712] [2019-12-07 12:41:45,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:45,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:45,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:45,423 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-12-07 12:41:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:45,478 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-12-07 12:41:45,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:45,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:41:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:45,484 INFO L225 Difference]: With dead ends: 7931 [2019-12-07 12:41:45,485 INFO L226 Difference]: Without dead ends: 7931 [2019-12-07 12:41:45,485 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 12:41:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-12-07 12:41:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-12-07 12:41:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-12-07 12:41:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-12-07 12:41:45,557 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-12-07 12:41:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:45,557 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-12-07 12:41:45,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-12-07 12:41:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:41:45,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:45,562 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 12:41:45,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:45,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-12-07 12:41:45,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:45,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017027210] [2019-12-07 12:41:45,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:45,597 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 12:41:45,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017027210] [2019-12-07 12:41:45,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:45,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:45,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875764537] [2019-12-07 12:41:45,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:45,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:45,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:45,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:45,598 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 3 states. [2019-12-07 12:41:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:45,620 INFO L93 Difference]: Finished difference Result 7211 states and 15694 transitions. [2019-12-07 12:41:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:45,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:41:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:45,625 INFO L225 Difference]: With dead ends: 7211 [2019-12-07 12:41:45,626 INFO L226 Difference]: Without dead ends: 7211 [2019-12-07 12:41:45,626 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 12:41:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7211 states. [2019-12-07 12:41:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7211 to 6970. [2019-12-07 12:41:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states. [2019-12-07 12:41:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 15214 transitions. [2019-12-07 12:41:45,692 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 15214 transitions. Word has length 33 [2019-12-07 12:41:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:45,693 INFO L462 AbstractCegarLoop]: Abstraction has 6970 states and 15214 transitions. [2019-12-07 12:41:45,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 15214 transitions. [2019-12-07 12:41:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:41:45,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:45,698 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 12:41:45,698 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash -693730356, now seen corresponding path program 1 times [2019-12-07 12:41:45,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:45,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169753394] [2019-12-07 12:41:45,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:45,747 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 12:41:45,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169753394] [2019-12-07 12:41:45,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:45,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:45,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292873546] [2019-12-07 12:41:45,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:45,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:45,748 INFO L87 Difference]: Start difference. First operand 6970 states and 15214 transitions. Second operand 5 states. [2019-12-07 12:41:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:45,785 INFO L93 Difference]: Finished difference Result 4541 states and 9958 transitions. [2019-12-07 12:41:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:45,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:41:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:45,788 INFO L225 Difference]: With dead ends: 4541 [2019-12-07 12:41:45,788 INFO L226 Difference]: Without dead ends: 4288 [2019-12-07 12:41:45,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-12-07 12:41:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3701. [2019-12-07 12:41:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-12-07 12:41:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 8291 transitions. [2019-12-07 12:41:45,825 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 8291 transitions. Word has length 33 [2019-12-07 12:41:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:45,826 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 8291 transitions. [2019-12-07 12:41:45,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 8291 transitions. [2019-12-07 12:41:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:41:45,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:45,830 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] [2019-12-07 12:41:45,830 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1153297112, now seen corresponding path program 1 times [2019-12-07 12:41:45,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:45,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889886598] [2019-12-07 12:41:45,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:45,899 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 12:41:45,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889886598] [2019-12-07 12:41:45,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:45,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:45,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124551611] [2019-12-07 12:41:45,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:45,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:45,900 INFO L87 Difference]: Start difference. First operand 3701 states and 8291 transitions. Second operand 4 states. [2019-12-07 12:41:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:46,063 INFO L93 Difference]: Finished difference Result 4087 states and 8972 transitions. [2019-12-07 12:41:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:41:46,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:41:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:46,066 INFO L225 Difference]: With dead ends: 4087 [2019-12-07 12:41:46,066 INFO L226 Difference]: Without dead ends: 4087 [2019-12-07 12:41:46,066 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 12:41:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2019-12-07 12:41:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 3951. [2019-12-07 12:41:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-12-07 12:41:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 8696 transitions. [2019-12-07 12:41:46,103 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 8696 transitions. Word has length 59 [2019-12-07 12:41:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:46,103 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 8696 transitions. [2019-12-07 12:41:46,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 8696 transitions. [2019-12-07 12:41:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:41:46,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:46,108 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] [2019-12-07 12:41:46,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -848544, now seen corresponding path program 2 times [2019-12-07 12:41:46,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360184337] [2019-12-07 12:41:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:46,189 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 12:41:46,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360184337] [2019-12-07 12:41:46,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:46,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:41:46,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229898661] [2019-12-07 12:41:46,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:41:46,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:41:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:46,190 INFO L87 Difference]: Start difference. First operand 3951 states and 8696 transitions. Second operand 6 states. [2019-12-07 12:41:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:46,398 INFO L93 Difference]: Finished difference Result 4281 states and 9301 transitions. [2019-12-07 12:41:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:41:46,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 12:41:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:46,402 INFO L225 Difference]: With dead ends: 4281 [2019-12-07 12:41:46,402 INFO L226 Difference]: Without dead ends: 4281 [2019-12-07 12:41:46,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2019-12-07 12:41:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4035. [2019-12-07 12:41:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-12-07 12:41:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 8829 transitions. [2019-12-07 12:41:46,441 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 8829 transitions. Word has length 59 [2019-12-07 12:41:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:46,441 INFO L462 AbstractCegarLoop]: Abstraction has 4035 states and 8829 transitions. [2019-12-07 12:41:46,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:41:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 8829 transitions. [2019-12-07 12:41:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:41:46,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:46,446 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] [2019-12-07 12:41:46,446 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1198603708, now seen corresponding path program 3 times [2019-12-07 12:41:46,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:46,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736490374] [2019-12-07 12:41:46,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:46,515 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 12:41:46,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736490374] [2019-12-07 12:41:46,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:46,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:41:46,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499403326] [2019-12-07 12:41:46,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:41:46,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:46,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:41:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:46,516 INFO L87 Difference]: Start difference. First operand 4035 states and 8829 transitions. Second operand 6 states. [2019-12-07 12:41:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:46,771 INFO L93 Difference]: Finished difference Result 5062 states and 10945 transitions. [2019-12-07 12:41:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:41:46,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 12:41:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:46,774 INFO L225 Difference]: With dead ends: 5062 [2019-12-07 12:41:46,775 INFO L226 Difference]: Without dead ends: 5062 [2019-12-07 12:41:46,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:41:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2019-12-07 12:41:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 4174. [2019-12-07 12:41:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-07 12:41:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9115 transitions. [2019-12-07 12:41:46,818 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9115 transitions. Word has length 59 [2019-12-07 12:41:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:46,818 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9115 transitions. [2019-12-07 12:41:46,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:41:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9115 transitions. [2019-12-07 12:41:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:41:46,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:46,822 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] [2019-12-07 12:41:46,823 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1500804762, now seen corresponding path program 4 times [2019-12-07 12:41:46,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:46,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158693540] [2019-12-07 12:41:46,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:46,882 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 12:41:46,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158693540] [2019-12-07 12:41:46,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:46,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:46,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809751462] [2019-12-07 12:41:46,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:46,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:46,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:46,884 INFO L87 Difference]: Start difference. First operand 4174 states and 9115 transitions. Second operand 5 states. [2019-12-07 12:41:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:47,017 INFO L93 Difference]: Finished difference Result 4979 states and 10650 transitions. [2019-12-07 12:41:47,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:41:47,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 12:41:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:47,022 INFO L225 Difference]: With dead ends: 4979 [2019-12-07 12:41:47,022 INFO L226 Difference]: Without dead ends: 4979 [2019-12-07 12:41:47,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 12:41:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2019-12-07 12:41:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4286. [2019-12-07 12:41:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-12-07 12:41:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 9343 transitions. [2019-12-07 12:41:47,061 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 9343 transitions. Word has length 59 [2019-12-07 12:41:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:47,062 INFO L462 AbstractCegarLoop]: Abstraction has 4286 states and 9343 transitions. [2019-12-07 12:41:47,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 9343 transitions. [2019-12-07 12:41:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:47,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:47,066 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] [2019-12-07 12:41:47,066 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2015434593, now seen corresponding path program 1 times [2019-12-07 12:41:47,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:47,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299468902] [2019-12-07 12:41:47,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:47,151 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 12:41:47,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299468902] [2019-12-07 12:41:47,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:47,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:47,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636746405] [2019-12-07 12:41:47,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:47,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:47,152 INFO L87 Difference]: Start difference. First operand 4286 states and 9343 transitions. Second operand 4 states. [2019-12-07 12:41:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:47,186 INFO L93 Difference]: Finished difference Result 4743 states and 10310 transitions. [2019-12-07 12:41:47,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:47,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 12:41:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:47,190 INFO L225 Difference]: With dead ends: 4743 [2019-12-07 12:41:47,190 INFO L226 Difference]: Without dead ends: 4219 [2019-12-07 12:41:47,190 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 12:41:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2019-12-07 12:41:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3812. [2019-12-07 12:41:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3812 states. [2019-12-07 12:41:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 8271 transitions. [2019-12-07 12:41:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 8271 transitions. Word has length 60 [2019-12-07 12:41:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:47,230 INFO L462 AbstractCegarLoop]: Abstraction has 3812 states and 8271 transitions. [2019-12-07 12:41:47,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 8271 transitions. [2019-12-07 12:41:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:47,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:47,235 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] [2019-12-07 12:41:47,235 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash -348317429, now seen corresponding path program 2 times [2019-12-07 12:41:47,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:47,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220151936] [2019-12-07 12:41:47,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:47,313 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 12:41:47,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220151936] [2019-12-07 12:41:47,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:47,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:41:47,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473998011] [2019-12-07 12:41:47,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:41:47,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:41:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:47,315 INFO L87 Difference]: Start difference. First operand 3812 states and 8271 transitions. Second operand 7 states. [2019-12-07 12:41:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:47,521 INFO L93 Difference]: Finished difference Result 6861 states and 14833 transitions. [2019-12-07 12:41:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:41:47,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-07 12:41:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:47,526 INFO L225 Difference]: With dead ends: 6861 [2019-12-07 12:41:47,526 INFO L226 Difference]: Without dead ends: 6183 [2019-12-07 12:41:47,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:41:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2019-12-07 12:41:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 5112. [2019-12-07 12:41:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2019-12-07 12:41:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 11239 transitions. [2019-12-07 12:41:47,581 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 11239 transitions. Word has length 60 [2019-12-07 12:41:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:47,582 INFO L462 AbstractCegarLoop]: Abstraction has 5112 states and 11239 transitions. [2019-12-07 12:41:47,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:41:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 11239 transitions. [2019-12-07 12:41:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:47,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:47,587 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] [2019-12-07 12:41:47,588 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1472715499, now seen corresponding path program 3 times [2019-12-07 12:41:47,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:47,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060018617] [2019-12-07 12:41:47,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:47,649 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 12:41:47,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060018617] [2019-12-07 12:41:47,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699412442] [2019-12-07 12:41:47,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:47,650 INFO L87 Difference]: Start difference. First operand 5112 states and 11239 transitions. Second operand 5 states. [2019-12-07 12:41:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:47,679 INFO L93 Difference]: Finished difference Result 5609 states and 12274 transitions. [2019-12-07 12:41:47,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:47,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-07 12:41:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:47,680 INFO L225 Difference]: With dead ends: 5609 [2019-12-07 12:41:47,680 INFO L226 Difference]: Without dead ends: 557 [2019-12-07 12:41:47,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-12-07 12:41:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-12-07 12:41:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-12-07 12:41:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1113 transitions. [2019-12-07 12:41:47,685 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1113 transitions. Word has length 60 [2019-12-07 12:41:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:47,685 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 1113 transitions. [2019-12-07 12:41:47,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1113 transitions. [2019-12-07 12:41:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:47,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:47,686 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] [2019-12-07 12:41:47,686 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 4 times [2019-12-07 12:41:47,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:47,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943048385] [2019-12-07 12:41:47,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:47,913 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 12:41:47,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943048385] [2019-12-07 12:41:47,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:47,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:41:47,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358093301] [2019-12-07 12:41:47,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:41:47,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:41:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:41:47,914 INFO L87 Difference]: Start difference. First operand 557 states and 1113 transitions. Second operand 14 states. [2019-12-07 12:41:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:48,672 INFO L93 Difference]: Finished difference Result 927 states and 1838 transitions. [2019-12-07 12:41:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:41:48,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-07 12:41:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:48,675 INFO L225 Difference]: With dead ends: 927 [2019-12-07 12:41:48,675 INFO L226 Difference]: Without dead ends: 700 [2019-12-07 12:41:48,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:41:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-07 12:41:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 561. [2019-12-07 12:41:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-07 12:41:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1121 transitions. [2019-12-07 12:41:48,689 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1121 transitions. Word has length 60 [2019-12-07 12:41:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:48,689 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 1121 transitions. [2019-12-07 12:41:48,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:41:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1121 transitions. [2019-12-07 12:41:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:48,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:48,691 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] [2019-12-07 12:41:48,691 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash 968885877, now seen corresponding path program 5 times [2019-12-07 12:41:48,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:48,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510042719] [2019-12-07 12:41:48,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:48,902 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 12:41:48,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510042719] [2019-12-07 12:41:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:48,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:41:48,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853393511] [2019-12-07 12:41:48,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:41:48,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:48,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:41:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:41:48,903 INFO L87 Difference]: Start difference. First operand 561 states and 1121 transitions. Second operand 14 states. [2019-12-07 12:41:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:50,122 INFO L93 Difference]: Finished difference Result 1084 states and 2137 transitions. [2019-12-07 12:41:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:41:50,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-07 12:41:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:50,123 INFO L225 Difference]: With dead ends: 1084 [2019-12-07 12:41:50,123 INFO L226 Difference]: Without dead ends: 700 [2019-12-07 12:41:50,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:41:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-07 12:41:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 561. [2019-12-07 12:41:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-07 12:41:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1120 transitions. [2019-12-07 12:41:50,129 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1120 transitions. Word has length 60 [2019-12-07 12:41:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:50,129 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 1120 transitions. [2019-12-07 12:41:50,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:41:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1120 transitions. [2019-12-07 12:41:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:50,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:50,130 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] [2019-12-07 12:41:50,130 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1304188265, now seen corresponding path program 6 times [2019-12-07 12:41:50,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:50,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106252221] [2019-12-07 12:41:50,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:50,359 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 12:41:50,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106252221] [2019-12-07 12:41:50,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:50,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:41:50,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361629331] [2019-12-07 12:41:50,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:41:50,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:41:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:41:50,360 INFO L87 Difference]: Start difference. First operand 561 states and 1120 transitions. Second operand 14 states. [2019-12-07 12:41:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:51,119 INFO L93 Difference]: Finished difference Result 1076 states and 2151 transitions. [2019-12-07 12:41:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 12:41:51,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-07 12:41:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:51,120 INFO L225 Difference]: With dead ends: 1076 [2019-12-07 12:41:51,120 INFO L226 Difference]: Without dead ends: 685 [2019-12-07 12:41:51,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:41:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-12-07 12:41:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 561. [2019-12-07 12:41:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-07 12:41:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2019-12-07 12:41:51,127 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 60 [2019-12-07 12:41:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:51,127 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2019-12-07 12:41:51,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:41:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2019-12-07 12:41:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:41:51,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:51,129 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] [2019-12-07 12:41:51,129 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 7 times [2019-12-07 12:41:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:51,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41644312] [2019-12-07 12:41:51,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:41:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:41:51,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:41:51,199 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:41:51,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_20|) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28| 1) |v_#valid_53|) (= 0 v_~weak$$choice0~0_156) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1723~0.base_28| 4)) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) |v_ULTIMATE.start_main_~#t1723~0.offset_20| 0))) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_28|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_20|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1723~0.offset, ~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_~#t1724~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:51,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-07 12:41:51,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:51,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-354428916 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-354428916 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-354428916 |P1Thread1of1ForFork1_#t~ite28_Out-354428916|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-354428916| ~y$w_buff1~0_In-354428916) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-354428916, ~y$w_buff1~0=~y$w_buff1~0_In-354428916, ~y$w_buff0~0=~y$w_buff0~0_In-354428916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-354428916} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-354428916, ~y$w_buff1~0=~y$w_buff1~0_In-354428916, ~y$w_buff0~0=~y$w_buff0~0_In-354428916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-354428916, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-354428916|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:41:51,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:41:51,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 12:41:51,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1219005721 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~y$mem_tmp~0_In1219005721) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~y~0_In1219005721) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1219005721, ~y$flush_delayed~0=~y$flush_delayed~0_In1219005721, ~y~0=~y~0_In1219005721} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1219005721, ~y$flush_delayed~0=~y$flush_delayed~0_In1219005721, ~y~0=~y~0_In1219005721, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1219005721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:41:51,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In457622257 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In457622257 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (not .cse1)) (and (= ~y$w_buff0_used~0_In457622257 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In457622257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In457622257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In457622257, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out457622257|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In457622257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:41:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In132684391 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In132684391 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In132684391 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In132684391 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| ~y$w_buff1_used~0_In132684391)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In132684391, ~y$w_buff0_used~0=~y$w_buff0_used~0_In132684391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In132684391, ~y$w_buff1_used~0=~y$w_buff1_used~0_In132684391} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In132684391, ~y$w_buff0_used~0=~y$w_buff0_used~0_In132684391, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out132684391|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In132684391, ~y$w_buff1_used~0=~y$w_buff1_used~0_In132684391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:41:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2100390433 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_Out-2100390433 ~y$r_buff0_thd2~0_In-2100390433)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2100390433 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-2100390433 0) (not .cse2)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100390433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2100390433} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2100390433|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100390433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2100390433} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:41:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1182433197 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1182433197 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1182433197 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1182433197 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1182433197 |P1Thread1of1ForFork1_#t~ite54_Out1182433197|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite54_Out1182433197| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1182433197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182433197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182433197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182433197} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1182433197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182433197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182433197, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1182433197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182433197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:41:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:41:51,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1700115520 256) 0))) (or (and .cse0 (= ~y~0_In1700115520 |P0Thread1of1ForFork0_#t~ite25_Out1700115520|)) (and (not .cse0) (= ~y$mem_tmp~0_In1700115520 |P0Thread1of1ForFork0_#t~ite25_Out1700115520|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1700115520, ~y$flush_delayed~0=~y$flush_delayed~0_In1700115520, ~y~0=~y~0_In1700115520} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1700115520, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1700115520|, ~y$flush_delayed~0=~y$flush_delayed~0_In1700115520, ~y~0=~y~0_In1700115520} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:41:51,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 12:41:51,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:41:51,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1808299051 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1808299051 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out-1808299051| ~y~0_In-1808299051)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1808299051| ~y$w_buff1~0_In-1808299051) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1808299051, ~y~0=~y~0_In-1808299051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808299051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808299051} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1808299051, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1808299051|, ~y~0=~y~0_In-1808299051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808299051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808299051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:41:51,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 12:41:51,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1738060322 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1738060322 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1738060322| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1738060322| ~y$w_buff0_used~0_In-1738060322) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738060322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1738060322} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738060322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1738060322, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1738060322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:41:51,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2127713832 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2127713832 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2127713832 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2127713832 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In2127713832 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127713832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127713832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127713832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127713832} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2127713832|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127713832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127713832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127713832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127713832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:41:51,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-825844460 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-825844460 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-825844460 |ULTIMATE.start_main_#t~ite61_Out-825844460|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-825844460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-825844460} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-825844460|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-825844460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-825844460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:41:51,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1145599133 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1145599133 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1145599133 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1145599133 256)))) (or (and (= ~y$r_buff1_thd0~0_In1145599133 |ULTIMATE.start_main_#t~ite62_Out1145599133|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1145599133|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1145599133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145599133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145599133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145599133} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1145599133|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145599133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145599133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145599133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145599133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:41:51,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:41:51,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:41:51 BasicIcfg [2019-12-07 12:41:51,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:41:51,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:41:51,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:41:51,283 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:41:51,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:41:33" (3/4) ... [2019-12-07 12:41:51,285 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:41:51,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_20|) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28| 1) |v_#valid_53|) (= 0 v_~weak$$choice0~0_156) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1723~0.base_28| 4)) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) |v_ULTIMATE.start_main_~#t1723~0.offset_20| 0))) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_28|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_20|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1723~0.offset, ~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_~#t1724~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:51,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-07 12:41:51,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:51,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-354428916 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-354428916 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-354428916 |P1Thread1of1ForFork1_#t~ite28_Out-354428916|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-354428916| ~y$w_buff1~0_In-354428916) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-354428916, ~y$w_buff1~0=~y$w_buff1~0_In-354428916, ~y$w_buff0~0=~y$w_buff0~0_In-354428916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-354428916} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-354428916, ~y$w_buff1~0=~y$w_buff1~0_In-354428916, ~y$w_buff0~0=~y$w_buff0~0_In-354428916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-354428916, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-354428916|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:41:51,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:41:51,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 12:41:51,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1219005721 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~y$mem_tmp~0_In1219005721) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~y~0_In1219005721) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1219005721, ~y$flush_delayed~0=~y$flush_delayed~0_In1219005721, ~y~0=~y~0_In1219005721} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1219005721, ~y$flush_delayed~0=~y$flush_delayed~0_In1219005721, ~y~0=~y~0_In1219005721, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1219005721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:41:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In457622257 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In457622257 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (not .cse1)) (and (= ~y$w_buff0_used~0_In457622257 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In457622257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In457622257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In457622257, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out457622257|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In457622257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:41:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In132684391 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In132684391 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In132684391 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In132684391 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| ~y$w_buff1_used~0_In132684391)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In132684391, ~y$w_buff0_used~0=~y$w_buff0_used~0_In132684391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In132684391, ~y$w_buff1_used~0=~y$w_buff1_used~0_In132684391} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In132684391, ~y$w_buff0_used~0=~y$w_buff0_used~0_In132684391, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out132684391|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In132684391, ~y$w_buff1_used~0=~y$w_buff1_used~0_In132684391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:41:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2100390433 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_Out-2100390433 ~y$r_buff0_thd2~0_In-2100390433)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2100390433 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-2100390433 0) (not .cse2)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100390433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2100390433} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2100390433|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100390433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2100390433} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:41:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1182433197 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1182433197 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1182433197 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1182433197 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1182433197 |P1Thread1of1ForFork1_#t~ite54_Out1182433197|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite54_Out1182433197| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1182433197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182433197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182433197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182433197} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1182433197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182433197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1182433197, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1182433197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1182433197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:41:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:41:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1700115520 256) 0))) (or (and .cse0 (= ~y~0_In1700115520 |P0Thread1of1ForFork0_#t~ite25_Out1700115520|)) (and (not .cse0) (= ~y$mem_tmp~0_In1700115520 |P0Thread1of1ForFork0_#t~ite25_Out1700115520|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1700115520, ~y$flush_delayed~0=~y$flush_delayed~0_In1700115520, ~y~0=~y~0_In1700115520} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1700115520, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1700115520|, ~y$flush_delayed~0=~y$flush_delayed~0_In1700115520, ~y~0=~y~0_In1700115520} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:41:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 12:41:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:41:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1808299051 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1808299051 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out-1808299051| ~y~0_In-1808299051)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1808299051| ~y$w_buff1~0_In-1808299051) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1808299051, ~y~0=~y~0_In-1808299051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808299051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808299051} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1808299051, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1808299051|, ~y~0=~y~0_In-1808299051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808299051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808299051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:41:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 12:41:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1738060322 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1738060322 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1738060322| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1738060322| ~y$w_buff0_used~0_In-1738060322) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738060322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1738060322} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1738060322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1738060322, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1738060322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:41:51,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2127713832 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2127713832 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2127713832 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2127713832 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In2127713832 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127713832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127713832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127713832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127713832} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2127713832|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127713832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127713832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127713832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127713832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:41:51,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-825844460 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-825844460 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-825844460 |ULTIMATE.start_main_#t~ite61_Out-825844460|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-825844460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-825844460} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-825844460|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-825844460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-825844460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:41:51,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1145599133 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1145599133 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1145599133 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1145599133 256)))) (or (and (= ~y$r_buff1_thd0~0_In1145599133 |ULTIMATE.start_main_#t~ite62_Out1145599133|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1145599133|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1145599133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145599133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145599133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145599133} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1145599133|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145599133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1145599133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1145599133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145599133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:41:51,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:41:51,374 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b787f4e0-d822-4cbb-a2b2-2b750b021a97/bin/uautomizer/witness.graphml [2019-12-07 12:41:51,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:41:51,375 INFO L168 Benchmark]: Toolchain (without parser) took 18842.38 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 935.3 MB in the beginning and 1.8 GB in the end (delta: -828.7 MB). Peak memory consumption was 338.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,376 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:41:51,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,377 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,377 INFO L168 Benchmark]: RCFGBuilder took 433.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,378 INFO L168 Benchmark]: TraceAbstraction took 17785.78 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -765.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,378 INFO L168 Benchmark]: Witness Printer took 91.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:51,380 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 433.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17785.78 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -765.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 91.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1723, ((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, 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] [L815] FCALL, FORK 0 pthread_create(&t1724, ((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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y 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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 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 [__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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 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=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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 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)) [L777] 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=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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 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)) [L778] 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=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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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)) [L779] 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=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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 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)) [L781] 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=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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L739] 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) [L740] 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=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L741] 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=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 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=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=2, weak$$choice2=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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) 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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] 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=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 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)) [L746] 1 __unbuffered_p0_EBX = 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3878 SDtfs, 4258 SDslu, 8617 SDs, 0 SdLazy, 5329 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60518occurred 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: 5.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 20449 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 209430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...