./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/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 309e2320435ac6cc0dee8681c7087fbab805aeec .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:35:18,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:35:18,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:35:18,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:35:18,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:35:18,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:35:18,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:35:18,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:35:18,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:35:18,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:35:18,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:35:18,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:35:18,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:35:18,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:35:18,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:35:18,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:35:18,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:35:18,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:35:18,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:35:18,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:35:18,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:35:18,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:35:18,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:35:18,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:35:18,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:35:18,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:35:18,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:35:18,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:35:18,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:35:18,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:35:18,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:35:18,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:35:18,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:35:18,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:35:18,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:35:18,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:35:18,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:35:18,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:35:18,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:35:18,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:35:18,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:35:18,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:35:18,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:35:18,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:35:18,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:35:18,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:35:18,967 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:35:18,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:35:18,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:35:18,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:35:18,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:35:18,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:35:18,969 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:35:18,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:35:18,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:35:18,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:35:18,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:35:18,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:35:18,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:35:18,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:35:18,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:35:18,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:35:18,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:35:18,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:35:18,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:35:18,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:35:18,971 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_1719861b-9aae-48a5-8790-7cc19aafcfe9/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 -> 309e2320435ac6cc0dee8681c7087fbab805aeec [2019-12-07 17:35:19,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:35:19,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:35:19,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:35:19,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:35:19,102 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:35:19,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_tso.oepc.i [2019-12-07 17:35:19,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/data/65095e71f/d71f7ea78ef44392b50c8e80160063e8/FLAGec1f3fe78 [2019-12-07 17:35:19,549 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:35:19,550 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/sv-benchmarks/c/pthread-wmm/mix009_tso.oepc.i [2019-12-07 17:35:19,559 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/data/65095e71f/d71f7ea78ef44392b50c8e80160063e8/FLAGec1f3fe78 [2019-12-07 17:35:19,936 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/data/65095e71f/d71f7ea78ef44392b50c8e80160063e8 [2019-12-07 17:35:19,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:35:19,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:35:19,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:19,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:35:19,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:35:19,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:19" (1/1) ... [2019-12-07 17:35:19,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:19, skipping insertion in model container [2019-12-07 17:35:19,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:35:19" (1/1) ... [2019-12-07 17:35:19,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:35:19,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:35:20,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:20,272 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:35:20,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:35:20,357 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:35:20,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20 WrapperNode [2019-12-07 17:35:20,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:35:20,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:20,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:35:20,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:35:20,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:35:20,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:35:20,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:35:20,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:35:20,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... [2019-12-07 17:35:20,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:35:20,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:35:20,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:35:20,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:35:20,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:35:20,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:35:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:35:20,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:35:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:35:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:35:20,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:35:20,461 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:35:20,803 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:35:20,803 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:35:20,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:20 BoogieIcfgContainer [2019-12-07 17:35:20,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:35:20,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:35:20,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:35:20,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:35:20,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:35:19" (1/3) ... [2019-12-07 17:35:20,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420ae7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:20, skipping insertion in model container [2019-12-07 17:35:20,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:35:20" (2/3) ... [2019-12-07 17:35:20,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420ae7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:35:20, skipping insertion in model container [2019-12-07 17:35:20,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:20" (3/3) ... [2019-12-07 17:35:20,808 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_tso.oepc.i [2019-12-07 17:35:20,814 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:35:20,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:35:20,819 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:35:20,819 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:35:20,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:35:20,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:35:20,881 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:35:20,881 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:35:20,881 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:35:20,881 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:35:20,881 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:35:20,882 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:35:20,882 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:35:20,882 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:35:20,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-07 17:35:20,893 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 17:35:20,940 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 17:35:20,940 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:20,948 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:35:20,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 17:35:20,987 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 17:35:20,987 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:35:20,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:35:21,000 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:35:21,001 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:35:23,860 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 17:35:23,943 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-07 17:35:23,943 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 17:35:23,945 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-07 17:35:24,259 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:35:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:35:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:35:24,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:24,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:35:24,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:24,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-07 17:35:24,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:24,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267398622] [2019-12-07 17:35:24,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:24,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267398622] [2019-12-07 17:35:24,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:24,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:35:24,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457093738] [2019-12-07 17:35:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:24,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:24,457 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:35:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:24,643 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-07 17:35:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:24,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:35:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:24,709 INFO L225 Difference]: With dead ends: 8466 [2019-12-07 17:35:24,709 INFO L226 Difference]: Without dead ends: 7974 [2019-12-07 17:35:24,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-07 17:35:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-07 17:35:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-07 17:35:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-07 17:35:24,976 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-07 17:35:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:24,976 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-07 17:35:24,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-07 17:35:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:35:24,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:24,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:24,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:24,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-07 17:35:24,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:24,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221635045] [2019-12-07 17:35:24,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:25,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221635045] [2019-12-07 17:35:25,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:25,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:25,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391847537] [2019-12-07 17:35:25,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:25,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:25,031 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-07 17:35:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:25,053 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-07 17:35:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:25,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 17:35:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:25,062 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 17:35:25,062 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 17:35:25,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 17:35:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-07 17:35:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 17:35:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-07 17:35:25,091 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-07 17:35:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:25,091 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-07 17:35:25,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-07 17:35:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:35:25,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:25,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:25,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-07 17:35:25,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:25,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126884600] [2019-12-07 17:35:25,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126884600] [2019-12-07 17:35:25,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:25,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836974363] [2019-12-07 17:35:25,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:35:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:35:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:25,163 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-07 17:35:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:25,344 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-07 17:35:25,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:35:25,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:35:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:25,355 INFO L225 Difference]: With dead ends: 1902 [2019-12-07 17:35:25,355 INFO L226 Difference]: Without dead ends: 1902 [2019-12-07 17:35:25,355 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 17:35:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-07 17:35:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-07 17:35:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-07 17:35:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-07 17:35:25,402 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-07 17:35:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:25,402 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-07 17:35:25,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:35:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-07 17:35:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:35:25,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:25,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:25,406 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-07 17:35:25,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:25,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 17:35:25,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:25,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198734394] [2019-12-07 17:35:25,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:25,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:35:25,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628799494] [2019-12-07 17:35:25,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:35:25,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:35:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:25,509 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-07 17:35:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:25,761 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-07 17:35:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:35:25,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:35:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:25,771 INFO L225 Difference]: With dead ends: 2385 [2019-12-07 17:35:25,771 INFO L226 Difference]: Without dead ends: 2385 [2019-12-07 17:35:25,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:35:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-07 17:35:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-07 17:35:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-07 17:35:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-07 17:35:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-07 17:35:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:25,799 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-07 17:35:25,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:35:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-07 17:35:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:35:25,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:25,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:25,801 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-12-07 17:35:25,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:25,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902316290] [2019-12-07 17:35:25,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:25,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902316290] [2019-12-07 17:35:25,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:25,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:35:25,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813254954] [2019-12-07 17:35:25,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:35:25,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:35:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:25,864 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 5 states. [2019-12-07 17:35:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:26,156 INFO L93 Difference]: Finished difference Result 2513 states and 5538 transitions. [2019-12-07 17:35:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:35:26,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:35:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:26,169 INFO L225 Difference]: With dead ends: 2513 [2019-12-07 17:35:26,169 INFO L226 Difference]: Without dead ends: 2513 [2019-12-07 17:35:26,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-12-07 17:35:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2218. [2019-12-07 17:35:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-12-07 17:35:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 4956 transitions. [2019-12-07 17:35:26,207 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 4956 transitions. Word has length 26 [2019-12-07 17:35:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:26,207 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 4956 transitions. [2019-12-07 17:35:26,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:35:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 4956 transitions. [2019-12-07 17:35:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:35:26,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:26,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:26,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -53278191, now seen corresponding path program 1 times [2019-12-07 17:35:26,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:26,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268141292] [2019-12-07 17:35:26,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:26,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268141292] [2019-12-07 17:35:26,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:26,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:26,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542639070] [2019-12-07 17:35:26,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:26,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:26,284 INFO L87 Difference]: Start difference. First operand 2218 states and 4956 transitions. Second operand 4 states. [2019-12-07 17:35:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:26,303 INFO L93 Difference]: Finished difference Result 2217 states and 4954 transitions. [2019-12-07 17:35:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:26,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:35:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:26,312 INFO L225 Difference]: With dead ends: 2217 [2019-12-07 17:35:26,312 INFO L226 Difference]: Without dead ends: 2217 [2019-12-07 17:35:26,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-12-07 17:35:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2019-12-07 17:35:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-07 17:35:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-07 17:35:26,350 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-07 17:35:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:26,350 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-07 17:35:26,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-07 17:35:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:35:26,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:26,352 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 17:35:26,353 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-07 17:35:26,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:26,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577911190] [2019-12-07 17:35:26,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:26,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577911190] [2019-12-07 17:35:26,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:26,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:26,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506820410] [2019-12-07 17:35:26,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:35:26,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:35:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:26,399 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-07 17:35:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:26,410 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-07 17:35:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:35:26,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 17:35:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:26,414 INFO L225 Difference]: With dead ends: 1233 [2019-12-07 17:35:26,414 INFO L226 Difference]: Without dead ends: 1233 [2019-12-07 17:35:26,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:35:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-07 17:35:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-07 17:35:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-07 17:35:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-07 17:35:26,429 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-07 17:35:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:26,429 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-07 17:35:26,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:35:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-07 17:35:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:35:26,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:26,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:26,432 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-12-07 17:35:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346207876] [2019-12-07 17:35:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:26,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346207876] [2019-12-07 17:35:26,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:26,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:35:26,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214699133] [2019-12-07 17:35:26,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:26,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:26,466 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-07 17:35:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:26,511 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-07 17:35:26,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:26,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:35:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:26,514 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 17:35:26,514 INFO L226 Difference]: Without dead ends: 1748 [2019-12-07 17:35:26,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-07 17:35:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-07 17:35:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-07 17:35:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-07 17:35:26,534 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-07 17:35:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:26,535 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-07 17:35:26,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-07 17:35:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:35:26,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:26,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:26,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-12-07 17:35:26,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:26,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221074104] [2019-12-07 17:35:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:26,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221074104] [2019-12-07 17:35:26,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:26,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:35:26,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695835044] [2019-12-07 17:35:26,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:35:26,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:35:26,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:35:26,611 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-12-07 17:35:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:27,097 INFO L93 Difference]: Finished difference Result 1848 states and 3839 transitions. [2019-12-07 17:35:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:35:27,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 17:35:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:27,101 INFO L225 Difference]: With dead ends: 1848 [2019-12-07 17:35:27,101 INFO L226 Difference]: Without dead ends: 1848 [2019-12-07 17:35:27,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:35:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-12-07 17:35:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1301. [2019-12-07 17:35:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-12-07 17:35:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2776 transitions. [2019-12-07 17:35:27,137 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2776 transitions. Word has length 51 [2019-12-07 17:35:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:27,137 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 2776 transitions. [2019-12-07 17:35:27,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:35:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2776 transitions. [2019-12-07 17:35:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:35:27,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:27,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:27,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2037363857, now seen corresponding path program 2 times [2019-12-07 17:35:27,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:27,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302076223] [2019-12-07 17:35:27,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:27,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302076223] [2019-12-07 17:35:27,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:27,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:35:27,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308867579] [2019-12-07 17:35:27,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:35:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:35:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:35:27,197 INFO L87 Difference]: Start difference. First operand 1301 states and 2776 transitions. Second operand 5 states. [2019-12-07 17:35:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:27,322 INFO L93 Difference]: Finished difference Result 1448 states and 3045 transitions. [2019-12-07 17:35:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:35:27,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 17:35:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:27,325 INFO L225 Difference]: With dead ends: 1448 [2019-12-07 17:35:27,325 INFO L226 Difference]: Without dead ends: 1448 [2019-12-07 17:35:27,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:35:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-12-07 17:35:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1311. [2019-12-07 17:35:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-07 17:35:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2798 transitions. [2019-12-07 17:35:27,348 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 2798 transitions. Word has length 51 [2019-12-07 17:35:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 2798 transitions. [2019-12-07 17:35:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:35:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2798 transitions. [2019-12-07 17:35:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:35:27,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:27,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:27,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1151208547, now seen corresponding path program 3 times [2019-12-07 17:35:27,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:27,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859061538] [2019-12-07 17:35:27,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:27,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859061538] [2019-12-07 17:35:27,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:27,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215251325] [2019-12-07 17:35:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:27,418 INFO L87 Difference]: Start difference. First operand 1311 states and 2798 transitions. Second operand 3 states. [2019-12-07 17:35:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:27,431 INFO L93 Difference]: Finished difference Result 1310 states and 2796 transitions. [2019-12-07 17:35:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:27,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:35:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:27,434 INFO L225 Difference]: With dead ends: 1310 [2019-12-07 17:35:27,434 INFO L226 Difference]: Without dead ends: 1310 [2019-12-07 17:35:27,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-07 17:35:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1097. [2019-12-07 17:35:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-12-07 17:35:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2386 transitions. [2019-12-07 17:35:27,448 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2386 transitions. Word has length 51 [2019-12-07 17:35:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:27,448 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 2386 transitions. [2019-12-07 17:35:27,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2386 transitions. [2019-12-07 17:35:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:35:27,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:27,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:27,450 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1483615416, now seen corresponding path program 1 times [2019-12-07 17:35:27,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:27,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676728415] [2019-12-07 17:35:27,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:27,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 17:35:27,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676728415] [2019-12-07 17:35:27,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:27,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:35:27,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115149939] [2019-12-07 17:35:27,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:35:27,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:35:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:27,516 INFO L87 Difference]: Start difference. First operand 1097 states and 2386 transitions. Second operand 3 states. [2019-12-07 17:35:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:27,554 INFO L93 Difference]: Finished difference Result 1347 states and 2911 transitions. [2019-12-07 17:35:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:35:27,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:35:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:27,556 INFO L225 Difference]: With dead ends: 1347 [2019-12-07 17:35:27,556 INFO L226 Difference]: Without dead ends: 1347 [2019-12-07 17:35:27,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:35:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-12-07 17:35:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1001. [2019-12-07 17:35:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-12-07 17:35:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2210 transitions. [2019-12-07 17:35:27,575 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2210 transitions. Word has length 52 [2019-12-07 17:35:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:27,576 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 2210 transitions. [2019-12-07 17:35:27,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:35:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2210 transitions. [2019-12-07 17:35:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:35:27,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:27,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:27,578 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 223383117, now seen corresponding path program 1 times [2019-12-07 17:35:27,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:27,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401586954] [2019-12-07 17:35:27,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:27,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401586954] [2019-12-07 17:35:27,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:27,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:35:27,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53747835] [2019-12-07 17:35:27,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:35:27,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:35:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:35:27,800 INFO L87 Difference]: Start difference. First operand 1001 states and 2210 transitions. Second operand 12 states. [2019-12-07 17:35:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:30,297 INFO L93 Difference]: Finished difference Result 3127 states and 6605 transitions. [2019-12-07 17:35:30,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:35:30,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 17:35:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:30,302 INFO L225 Difference]: With dead ends: 3127 [2019-12-07 17:35:30,302 INFO L226 Difference]: Without dead ends: 1865 [2019-12-07 17:35:30,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:35:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2019-12-07 17:35:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1051. [2019-12-07 17:35:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-12-07 17:35:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 2329 transitions. [2019-12-07 17:35:30,318 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 2329 transitions. Word has length 53 [2019-12-07 17:35:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:30,318 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 2329 transitions. [2019-12-07 17:35:30,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:35:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 2329 transitions. [2019-12-07 17:35:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:35:30,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:30,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:30,320 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1559154247, now seen corresponding path program 2 times [2019-12-07 17:35:30,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:30,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654129633] [2019-12-07 17:35:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:35:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:35:30,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654129633] [2019-12-07 17:35:30,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:35:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:35:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133043097] [2019-12-07 17:35:30,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:35:30,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:35:30,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:35:30,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:35:30,414 INFO L87 Difference]: Start difference. First operand 1051 states and 2329 transitions. Second operand 7 states. [2019-12-07 17:35:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:35:30,593 INFO L93 Difference]: Finished difference Result 2671 states and 5711 transitions. [2019-12-07 17:35:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:35:30,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:35:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:35:30,597 INFO L225 Difference]: With dead ends: 2671 [2019-12-07 17:35:30,598 INFO L226 Difference]: Without dead ends: 1933 [2019-12-07 17:35:30,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:35:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-07 17:35:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1064. [2019-12-07 17:35:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-12-07 17:35:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2347 transitions. [2019-12-07 17:35:30,613 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2347 transitions. Word has length 53 [2019-12-07 17:35:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:35:30,613 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2347 transitions. [2019-12-07 17:35:30,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:35:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2347 transitions. [2019-12-07 17:35:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:35:30,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:35:30,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:35:30,615 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:35:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:35:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 3 times [2019-12-07 17:35:30,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:35:30,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491409269] [2019-12-07 17:35:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:35:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:35:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:35:30,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:35:30,695 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:35:30,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t253~0.base_34|) (= 0 |v_ULTIMATE.start_main_~#t253~0.offset_22|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t253~0.base_34| 4)) (= v_~z$w_buff1~0_283 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t253~0.base_34| 1) |v_#valid_57|) (= v_~z~0_158 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t253~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t253~0.base_34|) |v_ULTIMATE.start_main_~#t253~0.offset_22| 0)) |v_#memory_int_15|) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_493 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t253~0.base_34|)) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t253~0.base=|v_ULTIMATE.start_main_~#t253~0.base_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, ULTIMATE.start_main_~#t254~0.offset=|v_ULTIMATE.start_main_~#t254~0.offset_21|, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ULTIMATE.start_main_~#t254~0.base=|v_ULTIMATE.start_main_~#t254~0.base_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t253~0.offset=|v_ULTIMATE.start_main_~#t253~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t253~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t254~0.offset, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t254~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t253~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:35:30,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= 1 ~z$r_buff0_thd1~0_Out-1986540866) (= ~z$r_buff0_thd1~0_In-1986540866 ~z$r_buff1_thd1~0_Out-1986540866) (= ~z$r_buff1_thd2~0_Out-1986540866 ~z$r_buff0_thd2~0_In-1986540866) (= ~x~0_Out-1986540866 ~__unbuffered_p0_EAX~0_Out-1986540866) (= ~__unbuffered_p0_EBX~0_Out-1986540866 ~y~0_In-1986540866) (= 1 ~x~0_Out-1986540866) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866)) (= ~z$r_buff0_thd0~0_In-1986540866 ~z$r_buff1_thd0~0_Out-1986540866)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1986540866, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866, ~y~0=~y~0_In-1986540866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1986540866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1986540866} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1986540866, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1986540866, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-1986540866, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1986540866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1986540866, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1986540866, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1986540866, ~y~0=~y~0_In-1986540866, ~x~0=~x~0_Out-1986540866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1986540866} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:35:30,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t254~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t254~0.base_12|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t254~0.base_12| 4) |v_#length_11|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t254~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t254~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t254~0.base_12|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t254~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t254~0.base_12|) |v_ULTIMATE.start_main_~#t254~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t254~0.base=|v_ULTIMATE.start_main_~#t254~0.base_12|, ULTIMATE.start_main_~#t254~0.offset=|v_ULTIMATE.start_main_~#t254~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t254~0.base, ULTIMATE.start_main_~#t254~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:35:30,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-941064769 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-941064769| |P1Thread1of1ForFork1_#t~ite21_Out-941064769|) (= |P1Thread1of1ForFork1_#t~ite20_Out-941064769| ~z$w_buff0_used~0_In-941064769) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-941064769 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-941064769 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-941064769 256))) (= (mod ~z$w_buff0_used~0_In-941064769 256) 0)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-941064769| ~z$w_buff0_used~0_In-941064769) (= |P1Thread1of1ForFork1_#t~ite20_In-941064769| |P1Thread1of1ForFork1_#t~ite20_Out-941064769|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-941064769|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-941064769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941064769, ~weak$$choice2~0=~weak$$choice2~0_In-941064769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-941064769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-941064769|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-941064769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-941064769|, ~weak$$choice2~0=~weak$$choice2~0_In-941064769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-941064769} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:35:30,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:35:30,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In623118667 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In623118667 256)))) (or (= (mod ~z$w_buff0_used~0_In623118667 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In623118667 256))) (and (= (mod ~z$w_buff1_used~0_In623118667 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite30_Out623118667| |P1Thread1of1ForFork1_#t~ite29_Out623118667|) .cse1 (= ~z$r_buff1_thd2~0_In623118667 |P1Thread1of1ForFork1_#t~ite29_Out623118667|)) (and (= ~z$r_buff1_thd2~0_In623118667 |P1Thread1of1ForFork1_#t~ite30_Out623118667|) (= |P1Thread1of1ForFork1_#t~ite29_In623118667| |P1Thread1of1ForFork1_#t~ite29_Out623118667|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In623118667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In623118667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In623118667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In623118667, ~weak$$choice2~0=~weak$$choice2~0_In623118667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In623118667} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out623118667|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out623118667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In623118667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In623118667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In623118667, ~weak$$choice2~0=~weak$$choice2~0_In623118667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In623118667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:35:30,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:35:30,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| |P1Thread1of1ForFork1_#t~ite33_Out-690437069|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-690437069 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-690437069 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| ~z~0_In-690437069) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| ~z$w_buff1~0_In-690437069) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-690437069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-690437069, ~z$w_buff1~0=~z$w_buff1~0_In-690437069, ~z~0=~z~0_In-690437069} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-690437069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-690437069, ~z$w_buff1~0=~z$w_buff1~0_In-690437069, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-690437069|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-690437069|, ~z~0=~z~0_In-690437069} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:35:30,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-858552612 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-858552612 256) 0))) (or (and (= ~z$w_buff0_used~0_In-858552612 |P1Thread1of1ForFork1_#t~ite34_Out-858552612|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-858552612|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-858552612, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-858552612} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-858552612, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-858552612|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-858552612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:35:30,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1011773743 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1011773743 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1011773743 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1011773743 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1011773743|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1011773743 |P1Thread1of1ForFork1_#t~ite35_Out-1011773743|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1011773743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1011773743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1011773743, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1011773743} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1011773743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1011773743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1011773743, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1011773743|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1011773743} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:35:30,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-216824504 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-216824504 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-216824504| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-216824504 |P1Thread1of1ForFork1_#t~ite36_Out-216824504|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-216824504, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-216824504} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-216824504, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-216824504, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-216824504|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:35:30,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1013039913 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1013039913 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1013039913| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1013039913| ~z$w_buff0_used~0_In-1013039913)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013039913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013039913} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1013039913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013039913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013039913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:35:30,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-862161475 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-862161475 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-862161475 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-862161475 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-862161475| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-862161475 |P0Thread1of1ForFork0_#t~ite6_Out-862161475|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-862161475, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-862161475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862161475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-862161475} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-862161475|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-862161475, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-862161475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862161475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-862161475} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1872028829 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1872028829 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1872028829 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1872028829 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1872028829| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1872028829| ~z$r_buff1_thd2~0_In1872028829)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1872028829, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1872028829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1872028829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1872028829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1872028829, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1872028829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1872028829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1872028829, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1872028829|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In553238603 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In553238603 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In553238603 ~z$r_buff0_thd1~0_Out553238603))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out553238603)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In553238603, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In553238603} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In553238603, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out553238603|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out553238603} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1827029568 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1827029568 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1827029568 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1827029568 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1827029568| 0)) (and (= ~z$r_buff1_thd1~0_In1827029568 |P0Thread1of1ForFork0_#t~ite8_Out1827029568|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1827029568, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827029568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827029568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827029568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1827029568, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1827029568|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827029568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827029568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827029568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:35:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:35:30,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In607338933 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In607338933 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out607338933| ~z~0_In607338933)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In607338933 |ULTIMATE.start_main_#t~ite40_Out607338933|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In607338933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607338933, ~z$w_buff1~0=~z$w_buff1~0_In607338933, ~z~0=~z~0_In607338933} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out607338933|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In607338933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607338933, ~z$w_buff1~0=~z$w_buff1~0_In607338933, ~z~0=~z~0_In607338933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:35:30,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 17:35:30,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1616182664 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1616182664 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1616182664 |ULTIMATE.start_main_#t~ite42_Out1616182664|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1616182664|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616182664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616182664} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616182664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616182664, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1616182664|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:35:30,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1450651772 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1450651772 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1450651772 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1450651772 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1450651772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1450651772 |ULTIMATE.start_main_#t~ite43_Out1450651772|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450651772, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450651772, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450651772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450651772} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450651772, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450651772, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450651772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450651772, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1450651772|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:35:30,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-599067350 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-599067350 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-599067350| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-599067350| ~z$r_buff0_thd0~0_In-599067350)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599067350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599067350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599067350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599067350, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-599067350|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:35:30,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In101764515 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In101764515 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In101764515 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In101764515 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In101764515 |ULTIMATE.start_main_#t~ite45_Out101764515|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out101764515|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101764515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101764515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101764515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101764515} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101764515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101764515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101764515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101764515, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out101764515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:35:30,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:35:30,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:35:30 BasicIcfg [2019-12-07 17:35:30,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:35:30,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:35:30,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:35:30,747 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:35:30,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:35:20" (3/4) ... [2019-12-07 17:35:30,749 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:35:30,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t253~0.base_34|) (= 0 |v_ULTIMATE.start_main_~#t253~0.offset_22|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t253~0.base_34| 4)) (= v_~z$w_buff1~0_283 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t253~0.base_34| 1) |v_#valid_57|) (= v_~z~0_158 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t253~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t253~0.base_34|) |v_ULTIMATE.start_main_~#t253~0.offset_22| 0)) |v_#memory_int_15|) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_493 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t253~0.base_34|)) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t253~0.base=|v_ULTIMATE.start_main_~#t253~0.base_34|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, ULTIMATE.start_main_~#t254~0.offset=|v_ULTIMATE.start_main_~#t254~0.offset_21|, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ULTIMATE.start_main_~#t254~0.base=|v_ULTIMATE.start_main_~#t254~0.base_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t253~0.offset=|v_ULTIMATE.start_main_~#t253~0.offset_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t253~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t254~0.offset, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t254~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t253~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:35:30,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= 1 ~z$r_buff0_thd1~0_Out-1986540866) (= ~z$r_buff0_thd1~0_In-1986540866 ~z$r_buff1_thd1~0_Out-1986540866) (= ~z$r_buff1_thd2~0_Out-1986540866 ~z$r_buff0_thd2~0_In-1986540866) (= ~x~0_Out-1986540866 ~__unbuffered_p0_EAX~0_Out-1986540866) (= ~__unbuffered_p0_EBX~0_Out-1986540866 ~y~0_In-1986540866) (= 1 ~x~0_Out-1986540866) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866)) (= ~z$r_buff0_thd0~0_In-1986540866 ~z$r_buff1_thd0~0_Out-1986540866)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1986540866, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866, ~y~0=~y~0_In-1986540866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1986540866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1986540866} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1986540866, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1986540866, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out-1986540866, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1986540866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1986540866, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1986540866, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1986540866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1986540866, ~y~0=~y~0_In-1986540866, ~x~0=~x~0_Out-1986540866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1986540866} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 17:35:30,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t254~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t254~0.base_12|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t254~0.base_12| 4) |v_#length_11|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t254~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t254~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t254~0.base_12|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t254~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t254~0.base_12|) |v_ULTIMATE.start_main_~#t254~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t254~0.base=|v_ULTIMATE.start_main_~#t254~0.base_12|, ULTIMATE.start_main_~#t254~0.offset=|v_ULTIMATE.start_main_~#t254~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t254~0.base, ULTIMATE.start_main_~#t254~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:35:30,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-941064769 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-941064769| |P1Thread1of1ForFork1_#t~ite21_Out-941064769|) (= |P1Thread1of1ForFork1_#t~ite20_Out-941064769| ~z$w_buff0_used~0_In-941064769) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-941064769 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-941064769 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-941064769 256))) (= (mod ~z$w_buff0_used~0_In-941064769 256) 0)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-941064769| ~z$w_buff0_used~0_In-941064769) (= |P1Thread1of1ForFork1_#t~ite20_In-941064769| |P1Thread1of1ForFork1_#t~ite20_Out-941064769|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-941064769|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-941064769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941064769, ~weak$$choice2~0=~weak$$choice2~0_In-941064769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-941064769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-941064769|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-941064769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-941064769, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-941064769|, ~weak$$choice2~0=~weak$$choice2~0_In-941064769, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-941064769} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:35:30,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:35:30,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In623118667 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In623118667 256)))) (or (= (mod ~z$w_buff0_used~0_In623118667 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In623118667 256))) (and (= (mod ~z$w_buff1_used~0_In623118667 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite30_Out623118667| |P1Thread1of1ForFork1_#t~ite29_Out623118667|) .cse1 (= ~z$r_buff1_thd2~0_In623118667 |P1Thread1of1ForFork1_#t~ite29_Out623118667|)) (and (= ~z$r_buff1_thd2~0_In623118667 |P1Thread1of1ForFork1_#t~ite30_Out623118667|) (= |P1Thread1of1ForFork1_#t~ite29_In623118667| |P1Thread1of1ForFork1_#t~ite29_Out623118667|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In623118667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In623118667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In623118667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In623118667, ~weak$$choice2~0=~weak$$choice2~0_In623118667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In623118667} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out623118667|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out623118667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In623118667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In623118667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In623118667, ~weak$$choice2~0=~weak$$choice2~0_In623118667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In623118667} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:35:30,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:35:30,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| |P1Thread1of1ForFork1_#t~ite33_Out-690437069|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-690437069 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-690437069 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| ~z~0_In-690437069) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-690437069| ~z$w_buff1~0_In-690437069) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-690437069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-690437069, ~z$w_buff1~0=~z$w_buff1~0_In-690437069, ~z~0=~z~0_In-690437069} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-690437069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-690437069, ~z$w_buff1~0=~z$w_buff1~0_In-690437069, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-690437069|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-690437069|, ~z~0=~z~0_In-690437069} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:35:30,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-858552612 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-858552612 256) 0))) (or (and (= ~z$w_buff0_used~0_In-858552612 |P1Thread1of1ForFork1_#t~ite34_Out-858552612|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-858552612|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-858552612, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-858552612} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-858552612, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-858552612|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-858552612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:35:30,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1011773743 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1011773743 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1011773743 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1011773743 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1011773743|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1011773743 |P1Thread1of1ForFork1_#t~ite35_Out-1011773743|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1011773743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1011773743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1011773743, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1011773743} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1011773743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1011773743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1011773743, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1011773743|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1011773743} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:35:30,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-216824504 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-216824504 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-216824504| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-216824504 |P1Thread1of1ForFork1_#t~ite36_Out-216824504|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-216824504, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-216824504} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-216824504, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-216824504, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-216824504|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:35:30,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1013039913 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1013039913 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1013039913| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1013039913| ~z$w_buff0_used~0_In-1013039913)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013039913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013039913} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1013039913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013039913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1013039913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:35:30,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-862161475 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-862161475 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-862161475 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-862161475 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-862161475| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-862161475 |P0Thread1of1ForFork0_#t~ite6_Out-862161475|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-862161475, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-862161475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862161475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-862161475} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-862161475|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-862161475, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-862161475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-862161475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-862161475} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1872028829 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1872028829 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1872028829 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1872028829 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1872028829| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1872028829| ~z$r_buff1_thd2~0_In1872028829)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1872028829, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1872028829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1872028829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1872028829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1872028829, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1872028829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1872028829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1872028829, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1872028829|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In553238603 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In553238603 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In553238603 ~z$r_buff0_thd1~0_Out553238603))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out553238603)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In553238603, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In553238603} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In553238603, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out553238603|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out553238603} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1827029568 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1827029568 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1827029568 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1827029568 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1827029568| 0)) (and (= ~z$r_buff1_thd1~0_In1827029568 |P0Thread1of1ForFork0_#t~ite8_Out1827029568|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1827029568, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827029568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827029568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827029568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1827029568, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1827029568|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1827029568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1827029568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1827029568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:35:30,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:35:30,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In607338933 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In607338933 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out607338933| ~z~0_In607338933)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In607338933 |ULTIMATE.start_main_#t~ite40_Out607338933|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In607338933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607338933, ~z$w_buff1~0=~z$w_buff1~0_In607338933, ~z~0=~z~0_In607338933} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out607338933|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In607338933, ~z$w_buff1_used~0=~z$w_buff1_used~0_In607338933, ~z$w_buff1~0=~z$w_buff1~0_In607338933, ~z~0=~z~0_In607338933} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:35:30,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 17:35:30,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1616182664 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1616182664 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1616182664 |ULTIMATE.start_main_#t~ite42_Out1616182664|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1616182664|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616182664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616182664} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1616182664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616182664, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1616182664|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:35:30,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1450651772 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1450651772 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1450651772 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1450651772 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1450651772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1450651772 |ULTIMATE.start_main_#t~ite43_Out1450651772|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450651772, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450651772, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450651772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450651772} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1450651772, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1450651772, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1450651772, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1450651772, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1450651772|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:35:30,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-599067350 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-599067350 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-599067350| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-599067350| ~z$r_buff0_thd0~0_In-599067350)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599067350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599067350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599067350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599067350, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-599067350|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:35:30,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In101764515 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In101764515 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In101764515 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In101764515 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In101764515 |ULTIMATE.start_main_#t~ite45_Out101764515|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out101764515|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101764515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101764515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101764515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101764515} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101764515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101764515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101764515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101764515, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out101764515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:35:30,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:35:30,806 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1719861b-9aae-48a5-8790-7cc19aafcfe9/bin/uautomizer/witness.graphml [2019-12-07 17:35:30,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:35:30,807 INFO L168 Benchmark]: Toolchain (without parser) took 10864.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.2 MB). Free memory was 942.5 MB in the beginning and 1.0 GB in the end (delta: -79.4 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,807 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:35:30,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,808 INFO L168 Benchmark]: Boogie Preprocessor took 23.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:35:30,808 INFO L168 Benchmark]: RCFGBuilder took 386.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,809 INFO L168 Benchmark]: TraceAbstraction took 9942.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -29.2 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,809 INFO L168 Benchmark]: Witness Printer took 59.57 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:35:30,810 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9942.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -29.2 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.57 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2160 SDtfs, 1806 SDslu, 5378 SDs, 0 SdLazy, 4263 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 20 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 4747 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 140068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...