./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_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_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/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 29b5bd3d8590d5317b5bacadb7398c07e3335e62 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:07:28,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:28,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:28,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:28,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:28,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:28,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:28,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:28,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:28,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:28,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:28,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:28,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:28,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:28,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:28,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:28,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:28,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:28,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:28,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:28,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:28,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:28,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:28,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:28,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:28,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:28,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:28,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:28,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:28,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:28,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:28,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:28,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:28,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:28,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:28,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:28,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:28,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:28,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:28,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:28,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:28,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:28,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:28,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:28,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:28,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:28,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:28,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:28,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:28,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:28,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:28,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:28,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:28,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:28,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:28,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:28,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:28,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:28,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:28,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:28,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:28,973 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_747343bb-d125-423d-9430-a02c18b388b0/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 -> 29b5bd3d8590d5317b5bacadb7398c07e3335e62 [2019-12-07 10:07:29,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:29,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:29,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:29,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:29,090 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:29,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_tso.oepc.i [2019-12-07 10:07:29,128 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/data/e26a4238a/fa29d6482fbf47ab8a7b72ca9c3d5ea1/FLAG9b65d6a69 [2019-12-07 10:07:29,593 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:29,593 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/sv-benchmarks/c/pthread-wmm/mix035_tso.oepc.i [2019-12-07 10:07:29,604 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/data/e26a4238a/fa29d6482fbf47ab8a7b72ca9c3d5ea1/FLAG9b65d6a69 [2019-12-07 10:07:29,615 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/data/e26a4238a/fa29d6482fbf47ab8a7b72ca9c3d5ea1 [2019-12-07 10:07:29,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:29,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:29,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:29,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:29,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29, skipping insertion in model container [2019-12-07 10:07:29,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:29,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:29,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,927 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:29,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:30,021 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:30,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30 WrapperNode [2019-12-07 10:07:30,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:30,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:30,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:30,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:30,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:30,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:30,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:30,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:30,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:30,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:30,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:30,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:30,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/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 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:07:30,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:07:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:30,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:30,140 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 10:07:30,501 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:30,501 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:30,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30 BoogieIcfgContainer [2019-12-07 10:07:30,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:30,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:30,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:30,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:30,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:29" (1/3) ... [2019-12-07 10:07:30,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282941fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (2/3) ... [2019-12-07 10:07:30,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282941fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/3) ... [2019-12-07 10:07:30,507 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2019-12-07 10:07:30,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:30,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:30,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:30,519 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:07:30,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:30,589 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:30,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:30,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:30,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:30,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:30,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:30,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:30,600 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-07 10:07:30,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 10:07:30,660 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 10:07:30,660 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:30,670 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:07:30,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 10:07:30,719 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 10:07:30,719 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:30,725 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:07:30,741 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 10:07:30,741 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:33,711 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 10:07:33,945 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 10:07:33,985 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-07 10:07:33,985 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 10:07:33,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-07 10:07:48,857 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-07 10:07:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-07 10:07:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:07:48,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:48,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:07:48,863 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-07 10:07:48,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407296672] [2019-12-07 10:07:48,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,017 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 10:07:49,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407296672] [2019-12-07 10:07:49,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:49,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:49,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358734215] [2019-12-07 10:07:49,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:49,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:49,037 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-07 10:07:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:49,741 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-07 10:07:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:49,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:07:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:50,398 INFO L225 Difference]: With dead ends: 117122 [2019-12-07 10:07:50,399 INFO L226 Difference]: Without dead ends: 109842 [2019-12-07 10:07:50,400 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 10:07:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-07 10:07:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-07 10:07:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-07 10:07:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-07 10:07:58,357 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-07 10:07:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,358 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-07 10:07:58,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-07 10:07:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:07:58,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:58,361 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-07 10:07:58,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338676739] [2019-12-07 10:07:58,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,436 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 10:07:58,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338676739] [2019-12-07 10:07:58,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:58,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862283862] [2019-12-07 10:07:58,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:58,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:58,438 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-07 10:07:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,442 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-07 10:07:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:59,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:07:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,877 INFO L225 Difference]: With dead ends: 170700 [2019-12-07 10:07:59,877 INFO L226 Difference]: Without dead ends: 170651 [2019-12-07 10:07:59,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-07 10:08:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-07 10:08:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-07 10:08:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-07 10:08:09,897 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-07 10:08:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:09,897 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-07 10:08:09,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-07 10:08:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:08:09,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:09,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:09,903 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-07 10:08:09,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:09,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029099733] [2019-12-07 10:08:09,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:09,957 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 10:08:09,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029099733] [2019-12-07 10:08:09,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:09,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:09,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142107551] [2019-12-07 10:08:09,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:09,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:09,958 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-07 10:08:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:10,060 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-07 10:08:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:10,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 10:08:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:10,132 INFO L225 Difference]: With dead ends: 33806 [2019-12-07 10:08:10,132 INFO L226 Difference]: Without dead ends: 33806 [2019-12-07 10:08:10,132 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 10:08:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-07 10:08:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-07 10:08:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-07 10:08:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-07 10:08:10,709 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-07 10:08:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:10,709 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-07 10:08:10,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-07 10:08:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:08:10,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:10,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:10,712 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-07 10:08:10,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:10,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714850479] [2019-12-07 10:08:10,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:10,740 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 10:08:10,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714850479] [2019-12-07 10:08:10,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:10,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:10,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800888255] [2019-12-07 10:08:10,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:10,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:10,741 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-07 10:08:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:10,906 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-07 10:08:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:10,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:08:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:10,993 INFO L225 Difference]: With dead ends: 52205 [2019-12-07 10:08:10,993 INFO L226 Difference]: Without dead ends: 52205 [2019-12-07 10:08:10,993 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 10:08:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-07 10:08:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-07 10:08:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-07 10:08:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-07 10:08:12,028 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-07 10:08:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:12,029 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-07 10:08:12,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-07 10:08:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:08:12,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:12,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:12,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-07 10:08:12,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:12,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779883400] [2019-12-07 10:08:12,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:12,083 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 10:08:12,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779883400] [2019-12-07 10:08:12,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:12,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:12,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576579668] [2019-12-07 10:08:12,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:12,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:12,084 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-07 10:08:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:12,324 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-07 10:08:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:12,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:08:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:12,391 INFO L225 Difference]: With dead ends: 46485 [2019-12-07 10:08:12,392 INFO L226 Difference]: Without dead ends: 46485 [2019-12-07 10:08:12,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-07 10:08:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-07 10:08:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-07 10:08:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-07 10:08:13,131 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-07 10:08:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:13,131 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-07 10:08:13,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-07 10:08:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:08:13,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:13,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:13,134 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-07 10:08:13,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:13,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612914330] [2019-12-07 10:08:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:13,181 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 10:08:13,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612914330] [2019-12-07 10:08:13,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:13,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:13,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734503263] [2019-12-07 10:08:13,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:13,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:13,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:13,183 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-07 10:08:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:13,467 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-07 10:08:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:13,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:08:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:13,551 INFO L225 Difference]: With dead ends: 51005 [2019-12-07 10:08:13,551 INFO L226 Difference]: Without dead ends: 51005 [2019-12-07 10:08:13,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-07 10:08:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-07 10:08:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-07 10:08:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-07 10:08:14,555 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-07 10:08:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:14,555 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-07 10:08:14,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-07 10:08:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:08:14,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:14,563 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] [2019-12-07 10:08:14,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-07 10:08:14,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:14,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063228511] [2019-12-07 10:08:14,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:14,631 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 10:08:14,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063228511] [2019-12-07 10:08:14,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:14,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:14,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48083725] [2019-12-07 10:08:14,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:14,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:14,632 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-07 10:08:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:15,078 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-07 10:08:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:08:15,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:08:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:15,170 INFO L225 Difference]: With dead ends: 60565 [2019-12-07 10:08:15,170 INFO L226 Difference]: Without dead ends: 60558 [2019-12-07 10:08:15,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-07 10:08:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-07 10:08:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-07 10:08:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-07 10:08:16,045 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-07 10:08:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:16,045 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-07 10:08:16,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-07 10:08:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:08:16,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:16,051 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] [2019-12-07 10:08:16,051 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-07 10:08:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927956992] [2019-12-07 10:08:16,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:16,106 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 10:08:16,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927956992] [2019-12-07 10:08:16,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:16,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:16,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965892206] [2019-12-07 10:08:16,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:16,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:16,107 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-07 10:08:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:16,578 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-07 10:08:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:08:16,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:08:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:16,674 INFO L225 Difference]: With dead ends: 63360 [2019-12-07 10:08:16,674 INFO L226 Difference]: Without dead ends: 63353 [2019-12-07 10:08:16,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-07 10:08:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-07 10:08:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-07 10:08:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-07 10:08:17,633 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-07 10:08:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:17,633 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-07 10:08:17,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-07 10:08:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:08:17,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:17,642 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 10:08:17,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-07 10:08:17,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:17,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722677288] [2019-12-07 10:08:17,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:17,677 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 10:08:17,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722677288] [2019-12-07 10:08:17,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:17,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:17,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303128506] [2019-12-07 10:08:17,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:17,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:17,678 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-07 10:08:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:17,734 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-07 10:08:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:17,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 10:08:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:17,755 INFO L225 Difference]: With dead ends: 18121 [2019-12-07 10:08:17,755 INFO L226 Difference]: Without dead ends: 18121 [2019-12-07 10:08:17,755 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 10:08:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-07 10:08:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-07 10:08:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-07 10:08:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-07 10:08:18,018 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-07 10:08:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:18,019 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-07 10:08:18,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-07 10:08:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:08:18,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:18,030 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 10:08:18,030 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-07 10:08:18,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:18,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194361746] [2019-12-07 10:08:18,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:18,053 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 10:08:18,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194361746] [2019-12-07 10:08:18,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:18,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:18,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646041095] [2019-12-07 10:08:18,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:18,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:18,054 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-07 10:08:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:18,127 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-07 10:08:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:18,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 10:08:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:18,152 INFO L225 Difference]: With dead ends: 23499 [2019-12-07 10:08:18,152 INFO L226 Difference]: Without dead ends: 23499 [2019-12-07 10:08:18,153 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 10:08:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-07 10:08:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-07 10:08:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-07 10:08:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-07 10:08:18,444 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-07 10:08:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:18,445 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-07 10:08:18,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-07 10:08:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:08:18,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:18,456 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 10:08:18,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-07 10:08:18,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:18,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071242455] [2019-12-07 10:08:18,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:18,512 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 10:08:18,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071242455] [2019-12-07 10:08:18,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:18,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:18,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466966112] [2019-12-07 10:08:18,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:18,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:18,513 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-07 10:08:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:18,742 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-07 10:08:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:18,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 10:08:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:18,766 INFO L225 Difference]: With dead ends: 21964 [2019-12-07 10:08:18,766 INFO L226 Difference]: Without dead ends: 21964 [2019-12-07 10:08:18,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-07 10:08:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-07 10:08:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-07 10:08:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-07 10:08:19,072 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-07 10:08:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:19,072 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-07 10:08:19,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-07 10:08:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:08:19,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:19,085 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 10:08:19,085 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-07 10:08:19,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:19,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691986437] [2019-12-07 10:08:19,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:19,141 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 10:08:19,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691986437] [2019-12-07 10:08:19,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:19,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:19,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852438936] [2019-12-07 10:08:19,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:19,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:19,142 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-07 10:08:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:19,225 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-07 10:08:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:19,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:08:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:19,247 INFO L225 Difference]: With dead ends: 20911 [2019-12-07 10:08:19,247 INFO L226 Difference]: Without dead ends: 20911 [2019-12-07 10:08:19,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-07 10:08:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-07 10:08:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-07 10:08:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-07 10:08:19,544 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-07 10:08:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:19,544 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-07 10:08:19,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-07 10:08:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:08:19,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:19,558 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] [2019-12-07 10:08:19,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-07 10:08:19,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496298879] [2019-12-07 10:08:19,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:19,636 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 10:08:19,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496298879] [2019-12-07 10:08:19,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:19,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:19,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001614348] [2019-12-07 10:08:19,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:19,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:19,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:19,637 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-07 10:08:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:19,885 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-07 10:08:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:19,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 10:08:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:19,910 INFO L225 Difference]: With dead ends: 24383 [2019-12-07 10:08:19,910 INFO L226 Difference]: Without dead ends: 24383 [2019-12-07 10:08:19,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-07 10:08:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-07 10:08:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-07 10:08:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-07 10:08:20,225 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-07 10:08:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:20,225 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-07 10:08:20,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-07 10:08:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:08:20,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:20,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:20,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:20,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-07 10:08:20,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:20,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486563175] [2019-12-07 10:08:20,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:20,303 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 10:08:20,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486563175] [2019-12-07 10:08:20,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:20,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:20,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164984731] [2019-12-07 10:08:20,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:20,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:20,305 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-07 10:08:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:20,750 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-07 10:08:20,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:20,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 10:08:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:20,781 INFO L225 Difference]: With dead ends: 27860 [2019-12-07 10:08:20,781 INFO L226 Difference]: Without dead ends: 27860 [2019-12-07 10:08:20,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:08:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-07 10:08:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-07 10:08:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-07 10:08:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-07 10:08:21,156 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-07 10:08:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:21,156 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-07 10:08:21,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-07 10:08:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:08:21,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:21,170 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] [2019-12-07 10:08:21,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-07 10:08:21,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:21,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781714889] [2019-12-07 10:08:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:21,235 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 10:08:21,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781714889] [2019-12-07 10:08:21,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:21,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:21,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888901120] [2019-12-07 10:08:21,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:21,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:21,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:21,237 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-07 10:08:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:21,715 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-07 10:08:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:21,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 10:08:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:21,745 INFO L225 Difference]: With dead ends: 27029 [2019-12-07 10:08:21,745 INFO L226 Difference]: Without dead ends: 27029 [2019-12-07 10:08:21,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:08:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-07 10:08:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-07 10:08:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-07 10:08:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-07 10:08:22,070 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-07 10:08:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:22,070 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-07 10:08:22,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-07 10:08:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:08:22,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:22,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:22,085 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-07 10:08:22,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:22,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078440114] [2019-12-07 10:08:22,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:22,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078440114] [2019-12-07 10:08:22,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:22,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:22,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452845671] [2019-12-07 10:08:22,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:22,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:22,136 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 5 states. [2019-12-07 10:08:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:22,538 INFO L93 Difference]: Finished difference Result 27484 states and 80804 transitions. [2019-12-07 10:08:22,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:22,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 10:08:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:22,569 INFO L225 Difference]: With dead ends: 27484 [2019-12-07 10:08:22,569 INFO L226 Difference]: Without dead ends: 27484 [2019-12-07 10:08:22,569 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 10:08:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27484 states. [2019-12-07 10:08:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27484 to 25379. [2019-12-07 10:08:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25379 states. [2019-12-07 10:08:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25379 states to 25379 states and 75086 transitions. [2019-12-07 10:08:22,969 INFO L78 Accepts]: Start accepts. Automaton has 25379 states and 75086 transitions. Word has length 39 [2019-12-07 10:08:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:22,969 INFO L462 AbstractCegarLoop]: Abstraction has 25379 states and 75086 transitions. [2019-12-07 10:08:22,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25379 states and 75086 transitions. [2019-12-07 10:08:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:08:22,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:22,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:22,990 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2018518931, now seen corresponding path program 2 times [2019-12-07 10:08:22,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:22,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606637780] [2019-12-07 10:08:22,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:23,039 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 10:08:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606637780] [2019-12-07 10:08:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755072418] [2019-12-07 10:08:23,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:23,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:23,040 INFO L87 Difference]: Start difference. First operand 25379 states and 75086 transitions. Second operand 3 states. [2019-12-07 10:08:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:23,112 INFO L93 Difference]: Finished difference Result 25379 states and 75007 transitions. [2019-12-07 10:08:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:23,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 10:08:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:23,141 INFO L225 Difference]: With dead ends: 25379 [2019-12-07 10:08:23,141 INFO L226 Difference]: Without dead ends: 25379 [2019-12-07 10:08:23,141 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 10:08:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25379 states. [2019-12-07 10:08:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25379 to 21128. [2019-12-07 10:08:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21128 states. [2019-12-07 10:08:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21128 states to 21128 states and 63268 transitions. [2019-12-07 10:08:23,484 INFO L78 Accepts]: Start accepts. Automaton has 21128 states and 63268 transitions. Word has length 39 [2019-12-07 10:08:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:23,484 INFO L462 AbstractCegarLoop]: Abstraction has 21128 states and 63268 transitions. [2019-12-07 10:08:23,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21128 states and 63268 transitions. [2019-12-07 10:08:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:08:23,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:23,501 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] [2019-12-07 10:08:23,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1880616532, now seen corresponding path program 1 times [2019-12-07 10:08:23,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:23,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516077424] [2019-12-07 10:08:23,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:23,534 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 10:08:23,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516077424] [2019-12-07 10:08:23,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:23,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:23,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157588245] [2019-12-07 10:08:23,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:23,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:23,536 INFO L87 Difference]: Start difference. First operand 21128 states and 63268 transitions. Second operand 5 states. [2019-12-07 10:08:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:23,615 INFO L93 Difference]: Finished difference Result 19886 states and 60599 transitions. [2019-12-07 10:08:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:23,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 10:08:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:23,640 INFO L225 Difference]: With dead ends: 19886 [2019-12-07 10:08:23,640 INFO L226 Difference]: Without dead ends: 19886 [2019-12-07 10:08:23,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2019-12-07 10:08:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 19886. [2019-12-07 10:08:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19886 states. [2019-12-07 10:08:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19886 states to 19886 states and 60599 transitions. [2019-12-07 10:08:23,928 INFO L78 Accepts]: Start accepts. Automaton has 19886 states and 60599 transitions. Word has length 40 [2019-12-07 10:08:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:23,928 INFO L462 AbstractCegarLoop]: Abstraction has 19886 states and 60599 transitions. [2019-12-07 10:08:23,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19886 states and 60599 transitions. [2019-12-07 10:08:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:08:23,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:23,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:23,945 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-07 10:08:23,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:23,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113267076] [2019-12-07 10:08:23,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:24,001 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 10:08:24,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113267076] [2019-12-07 10:08:24,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:24,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:24,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015755267] [2019-12-07 10:08:24,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:24,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:24,003 INFO L87 Difference]: Start difference. First operand 19886 states and 60599 transitions. Second operand 6 states. [2019-12-07 10:08:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:24,520 INFO L93 Difference]: Finished difference Result 26076 states and 78229 transitions. [2019-12-07 10:08:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:08:24,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 10:08:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:24,550 INFO L225 Difference]: With dead ends: 26076 [2019-12-07 10:08:24,550 INFO L226 Difference]: Without dead ends: 26076 [2019-12-07 10:08:24,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:08:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26076 states. [2019-12-07 10:08:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26076 to 20623. [2019-12-07 10:08:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20623 states. [2019-12-07 10:08:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20623 states to 20623 states and 62770 transitions. [2019-12-07 10:08:24,893 INFO L78 Accepts]: Start accepts. Automaton has 20623 states and 62770 transitions. Word has length 65 [2019-12-07 10:08:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:24,894 INFO L462 AbstractCegarLoop]: Abstraction has 20623 states and 62770 transitions. [2019-12-07 10:08:24,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20623 states and 62770 transitions. [2019-12-07 10:08:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:08:24,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:24,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:24,911 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 2 times [2019-12-07 10:08:24,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:24,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445233451] [2019-12-07 10:08:24,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:24,955 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 10:08:24,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445233451] [2019-12-07 10:08:24,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:24,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:24,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106559778] [2019-12-07 10:08:24,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:24,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:24,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:24,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:24,957 INFO L87 Difference]: Start difference. First operand 20623 states and 62770 transitions. Second operand 3 states. [2019-12-07 10:08:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:25,074 INFO L93 Difference]: Finished difference Result 23651 states and 71790 transitions. [2019-12-07 10:08:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:25,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:08:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:25,096 INFO L225 Difference]: With dead ends: 23651 [2019-12-07 10:08:25,096 INFO L226 Difference]: Without dead ends: 23651 [2019-12-07 10:08:25,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:08:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23651 states. [2019-12-07 10:08:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23651 to 18188. [2019-12-07 10:08:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18188 states. [2019-12-07 10:08:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18188 states to 18188 states and 55630 transitions. [2019-12-07 10:08:25,387 INFO L78 Accepts]: Start accepts. Automaton has 18188 states and 55630 transitions. Word has length 65 [2019-12-07 10:08:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:25,387 INFO L462 AbstractCegarLoop]: Abstraction has 18188 states and 55630 transitions. [2019-12-07 10:08:25,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18188 states and 55630 transitions. [2019-12-07 10:08:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:08:25,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:25,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:25,402 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1192905868, now seen corresponding path program 1 times [2019-12-07 10:08:25,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:25,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430077315] [2019-12-07 10:08:25,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:25,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 10:08:25,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430077315] [2019-12-07 10:08:25,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:25,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646047646] [2019-12-07 10:08:25,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:25,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:25,437 INFO L87 Difference]: Start difference. First operand 18188 states and 55630 transitions. Second operand 3 states. [2019-12-07 10:08:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:25,492 INFO L93 Difference]: Finished difference Result 17147 states and 51566 transitions. [2019-12-07 10:08:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:25,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:08:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:25,510 INFO L225 Difference]: With dead ends: 17147 [2019-12-07 10:08:25,510 INFO L226 Difference]: Without dead ends: 17147 [2019-12-07 10:08:25,510 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 10:08:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17147 states. [2019-12-07 10:08:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17147 to 16175. [2019-12-07 10:08:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16175 states. [2019-12-07 10:08:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16175 states to 16175 states and 48726 transitions. [2019-12-07 10:08:25,749 INFO L78 Accepts]: Start accepts. Automaton has 16175 states and 48726 transitions. Word has length 66 [2019-12-07 10:08:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:25,749 INFO L462 AbstractCegarLoop]: Abstraction has 16175 states and 48726 transitions. [2019-12-07 10:08:25,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16175 states and 48726 transitions. [2019-12-07 10:08:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:08:25,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:25,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:25,763 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-07 10:08:25,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:25,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320700973] [2019-12-07 10:08:25,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:25,871 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 10:08:25,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320700973] [2019-12-07 10:08:25,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:25,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:08:25,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720054702] [2019-12-07 10:08:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:08:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:08:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:08:25,872 INFO L87 Difference]: Start difference. First operand 16175 states and 48726 transitions. Second operand 11 states. [2019-12-07 10:08:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:27,062 INFO L93 Difference]: Finished difference Result 49648 states and 148170 transitions. [2019-12-07 10:08:27,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:08:27,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 10:08:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:27,100 INFO L225 Difference]: With dead ends: 49648 [2019-12-07 10:08:27,100 INFO L226 Difference]: Without dead ends: 32441 [2019-12-07 10:08:27,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=1269, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:08:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32441 states. [2019-12-07 10:08:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32441 to 18259. [2019-12-07 10:08:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18259 states. [2019-12-07 10:08:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18259 states to 18259 states and 54380 transitions. [2019-12-07 10:08:27,458 INFO L78 Accepts]: Start accepts. Automaton has 18259 states and 54380 transitions. Word has length 67 [2019-12-07 10:08:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:27,458 INFO L462 AbstractCegarLoop]: Abstraction has 18259 states and 54380 transitions. [2019-12-07 10:08:27,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:08:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18259 states and 54380 transitions. [2019-12-07 10:08:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:08:27,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:27,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:27,474 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-07 10:08:27,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:27,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962612766] [2019-12-07 10:08:27,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:27,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:08:27,556 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:08:27,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30|) |v_ULTIMATE.start_main_~#t931~0.offset_22| 0)) |v_#memory_int_19|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30| 1)) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_22|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_30| 4)) (= v_~a$mem_tmp~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30|) 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_23|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_30|, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_17|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_13|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 10:08:27,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-637563313 ~x~0_In-637563313) (= ~a$r_buff1_thd3~0_Out-637563313 ~a$r_buff0_thd3~0_In-637563313) (= ~a$r_buff0_thd2~0_In-637563313 ~a$r_buff1_thd2~0_Out-637563313) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313)) (= ~a$r_buff0_thd1~0_In-637563313 ~a$r_buff1_thd1~0_Out-637563313) (= ~a$r_buff0_thd1~0_Out-637563313 1) (= ~a$r_buff1_thd0~0_Out-637563313 ~a$r_buff0_thd0~0_In-637563313)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-637563313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-637563313, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-637563313, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-637563313, ~x~0=~x~0_In-637563313} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-637563313, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-637563313, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-637563313, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-637563313, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-637563313, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-637563313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-637563313, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-637563313, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-637563313, ~x~0=~x~0_In-637563313} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:27,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:27,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:27,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2122992542 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2122992542 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In-2122992542 |P1Thread1of1ForFork2_#t~ite9_Out-2122992542|)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In-2122992542 |P1Thread1of1ForFork2_#t~ite9_Out-2122992542|)))) InVars {~a~0=~a~0_In-2122992542, ~a$w_buff1~0=~a$w_buff1~0_In-2122992542, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} OutVars{~a~0=~a~0_In-2122992542, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2122992542|, ~a$w_buff1~0=~a$w_buff1~0_In-2122992542, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:08:27,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 10:08:27,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1468227250 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1468227250 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1468227250| ~a$w_buff0_used~0_In1468227250)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1468227250| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468227250, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468227250, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1468227250|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:08:27,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-173599437 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-173599437 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-173599437 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-173599437 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-173599437 |P1Thread1of1ForFork2_#t~ite12_Out-173599437|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-173599437| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-173599437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-173599437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-173599437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-173599437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-173599437, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-173599437|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 10:08:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1122386883 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1122386883 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1122386883|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1122386883 |P1Thread1of1ForFork2_#t~ite13_Out-1122386883|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122386883, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122386883} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122386883, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122386883, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1122386883|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 10:08:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1926187351 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1926187351 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1926187351 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1926187351 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1926187351| ~a$r_buff1_thd2~0_In-1926187351) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1926187351| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1926187351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1926187351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1926187351|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:08:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:08:27,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1864526349 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1864526349 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1864526349| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1864526349| ~a$w_buff0_used~0_In-1864526349) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1864526349} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1864526349|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1864526349} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 10:08:27,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In1985926963 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1985926963 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1985926963 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In1985926963 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1985926963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1985926963 |P0Thread1of1ForFork1_#t~ite6_Out1985926963|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1985926963|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 10:08:27,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1995230310 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1995230310 256))) (.cse1 (= ~a$r_buff0_thd1~0_In-1995230310 ~a$r_buff0_thd1~0_Out-1995230310))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1995230310) (not .cse2)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1995230310} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1995230310|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1995230310} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:27,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-28746654 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-28746654 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-28746654 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-28746654 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-28746654 |P0Thread1of1ForFork1_#t~ite8_Out-28746654|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-28746654|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-28746654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28746654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-28746654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28746654} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-28746654|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-28746654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28746654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-28746654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28746654} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 10:08:27,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:08:27,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In186984993 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In186984993| |P2Thread1of1ForFork0_#t~ite29_Out186984993|) (= ~a$w_buff1_used~0_In186984993 |P2Thread1of1ForFork0_#t~ite30_Out186984993|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out186984993| |P2Thread1of1ForFork0_#t~ite30_Out186984993|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out186984993| ~a$w_buff1_used~0_In186984993) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In186984993 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In186984993 256))) (and (= 0 (mod ~a$r_buff1_thd3~0_In186984993 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In186984993 256))))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In186984993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In186984993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In186984993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In186984993, ~weak$$choice2~0=~weak$$choice2~0_In186984993, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In186984993|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In186984993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In186984993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In186984993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In186984993, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out186984993|, ~weak$$choice2~0=~weak$$choice2~0_In186984993, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out186984993|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:27,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:08:27,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 10:08:27,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1572127263 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1572127263 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1572127263| ~a~0_In1572127263)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1572127263| ~a$w_buff1~0_In1572127263) (not .cse0)))) InVars {~a~0=~a~0_In1572127263, ~a$w_buff1~0=~a$w_buff1~0_In1572127263, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1572127263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1572127263} OutVars{~a~0=~a~0_In1572127263, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1572127263|, ~a$w_buff1~0=~a$w_buff1~0_In1572127263, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1572127263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1572127263} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:08:27,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:08:27,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In2076576049 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2076576049 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2076576049| ~a$w_buff0_used~0_In2076576049)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2076576049| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2076576049} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2076576049|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2076576049} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 10:08:27,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1706967291 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1706967291 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1706967291 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1706967291 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1706967291|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1706967291 |P2Thread1of1ForFork0_#t~ite41_Out1706967291|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1706967291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1706967291} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1706967291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1706967291, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1706967291|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 10:08:27,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1886088361 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1886088361 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1886088361|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1886088361| ~a$r_buff0_thd3~0_In1886088361)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1886088361} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1886088361, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1886088361|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:08:27,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1609626942 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1609626942 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1609626942 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1609626942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out1609626942| 0)) (and (= ~a$r_buff1_thd3~0_In1609626942 |P2Thread1of1ForFork0_#t~ite43_Out1609626942|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1609626942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609626942, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1609626942, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609626942} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1609626942|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1609626942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609626942, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1609626942, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609626942} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 10:08:27,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:08:27,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:08:27,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-988206060| |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-988206060 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-988206060 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (and .cse0 (= ~a~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} OutVars{~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-988206060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-988206060|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:08:27,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-886766154 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-886766154 256) 0))) (or (and (= ~a$w_buff0_used~0_In-886766154 |ULTIMATE.start_main_#t~ite49_Out-886766154|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-886766154|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-886766154, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-886766154} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-886766154, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-886766154|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-886766154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:08:27,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-95934758 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-95934758 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-95934758 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-95934758 256) 0))) (or (and (= ~a$w_buff1_used~0_In-95934758 |ULTIMATE.start_main_#t~ite50_Out-95934758|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-95934758|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-95934758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-95934758} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-95934758|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-95934758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-95934758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:08:27,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1468979203 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1468979203 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1468979203|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1468979203 |ULTIMATE.start_main_#t~ite51_Out1468979203|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1468979203, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468979203} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1468979203|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468979203, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468979203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:08:27,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-854313214 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-854313214 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-854313214 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-854313214 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-854313214| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-854313214| ~a$r_buff1_thd0~0_In-854313214)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-854313214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-854313214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-854313214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-854313214} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-854313214|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-854313214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-854313214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-854313214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-854313214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:08:27,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:27,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:27 BasicIcfg [2019-12-07 10:08:27,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:27,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:27,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:27,628 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:27,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/4) ... [2019-12-07 10:08:27,630 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:08:27,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t931~0.base_30|) |v_ULTIMATE.start_main_~#t931~0.offset_22| 0)) |v_#memory_int_19|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t931~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30| 1)) (= 0 |v_ULTIMATE.start_main_~#t931~0.offset_22|) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t931~0.base_30| 4)) (= v_~a$mem_tmp~0_16 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t931~0.base_30|) 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_23|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t931~0.offset=|v_ULTIMATE.start_main_~#t931~0.offset_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ULTIMATE.start_main_~#t931~0.base=|v_ULTIMATE.start_main_~#t931~0.base_30|, ~x~0=v_~x~0_153, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_17|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_13|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t932~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t931~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t931~0.base, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t933~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t932~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t933~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 10:08:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-637563313 ~x~0_In-637563313) (= ~a$r_buff1_thd3~0_Out-637563313 ~a$r_buff0_thd3~0_In-637563313) (= ~a$r_buff0_thd2~0_In-637563313 ~a$r_buff1_thd2~0_Out-637563313) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313)) (= ~a$r_buff0_thd1~0_In-637563313 ~a$r_buff1_thd1~0_Out-637563313) (= ~a$r_buff0_thd1~0_Out-637563313 1) (= ~a$r_buff1_thd0~0_Out-637563313 ~a$r_buff0_thd0~0_In-637563313)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-637563313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-637563313, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-637563313, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-637563313, ~x~0=~x~0_In-637563313} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-637563313, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-637563313, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-637563313, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-637563313, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-637563313, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-637563313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-637563313, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-637563313, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-637563313, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-637563313, ~x~0=~x~0_In-637563313} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t932~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t932~0.base_11|) |v_ULTIMATE.start_main_~#t932~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t932~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t932~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t932~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t932~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t932~0.base=|v_ULTIMATE.start_main_~#t932~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t932~0.offset=|v_ULTIMATE.start_main_~#t932~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t932~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t932~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t933~0.base_11| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t933~0.base_11|) |v_ULTIMATE.start_main_~#t933~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t933~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t933~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t933~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t933~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t933~0.base=|v_ULTIMATE.start_main_~#t933~0.base_11|, ULTIMATE.start_main_~#t933~0.offset=|v_ULTIMATE.start_main_~#t933~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t933~0.base, ULTIMATE.start_main_~#t933~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2122992542 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2122992542 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In-2122992542 |P1Thread1of1ForFork2_#t~ite9_Out-2122992542|)) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In-2122992542 |P1Thread1of1ForFork2_#t~ite9_Out-2122992542|)))) InVars {~a~0=~a~0_In-2122992542, ~a$w_buff1~0=~a$w_buff1~0_In-2122992542, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} OutVars{~a~0=~a~0_In-2122992542, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2122992542|, ~a$w_buff1~0=~a$w_buff1~0_In-2122992542, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2122992542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2122992542} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:08:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 10:08:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1468227250 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1468227250 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1468227250| ~a$w_buff0_used~0_In1468227250)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1468227250| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468227250, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1468227250, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468227250, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1468227250|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 10:08:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-173599437 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-173599437 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-173599437 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-173599437 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-173599437 |P1Thread1of1ForFork2_#t~ite12_Out-173599437|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-173599437| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-173599437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-173599437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-173599437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-173599437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-173599437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-173599437, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-173599437|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-173599437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 10:08:27,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1122386883 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1122386883 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1122386883|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1122386883 |P1Thread1of1ForFork2_#t~ite13_Out-1122386883|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122386883, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122386883} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122386883, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122386883, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1122386883|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 10:08:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1926187351 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1926187351 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1926187351 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1926187351 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1926187351| ~a$r_buff1_thd2~0_In-1926187351) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1926187351| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1926187351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1926187351, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1926187351, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926187351, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926187351, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1926187351|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 10:08:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:08:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1864526349 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1864526349 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1864526349| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1864526349| ~a$w_buff0_used~0_In-1864526349) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1864526349} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1864526349|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1864526349, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1864526349} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 10:08:27,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In1985926963 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1985926963 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1985926963 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In1985926963 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1985926963|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1985926963 |P0Thread1of1ForFork1_#t~ite6_Out1985926963|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1985926963|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1985926963, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1985926963, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1985926963, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1985926963} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 10:08:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1995230310 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1995230310 256))) (.cse1 (= ~a$r_buff0_thd1~0_In-1995230310 ~a$r_buff0_thd1~0_Out-1995230310))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1995230310) (not .cse2)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1995230310} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1995230310|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1995230310, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1995230310} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-28746654 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-28746654 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-28746654 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-28746654 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-28746654 |P0Thread1of1ForFork1_#t~ite8_Out-28746654|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-28746654|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-28746654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28746654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-28746654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28746654} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-28746654|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-28746654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28746654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-28746654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28746654} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 10:08:27,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:08:27,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In186984993 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In186984993| |P2Thread1of1ForFork0_#t~ite29_Out186984993|) (= ~a$w_buff1_used~0_In186984993 |P2Thread1of1ForFork0_#t~ite30_Out186984993|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out186984993| |P2Thread1of1ForFork0_#t~ite30_Out186984993|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out186984993| ~a$w_buff1_used~0_In186984993) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In186984993 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In186984993 256))) (and (= 0 (mod ~a$r_buff1_thd3~0_In186984993 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In186984993 256))))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In186984993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In186984993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In186984993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In186984993, ~weak$$choice2~0=~weak$$choice2~0_In186984993, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In186984993|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In186984993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In186984993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In186984993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In186984993, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out186984993|, ~weak$$choice2~0=~weak$$choice2~0_In186984993, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out186984993|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:27,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:08:27,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 10:08:27,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In1572127263 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1572127263 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1572127263| ~a~0_In1572127263)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1572127263| ~a$w_buff1~0_In1572127263) (not .cse0)))) InVars {~a~0=~a~0_In1572127263, ~a$w_buff1~0=~a$w_buff1~0_In1572127263, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1572127263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1572127263} OutVars{~a~0=~a~0_In1572127263, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1572127263|, ~a$w_buff1~0=~a$w_buff1~0_In1572127263, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1572127263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1572127263} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:08:27,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 10:08:27,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In2076576049 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2076576049 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2076576049| ~a$w_buff0_used~0_In2076576049)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out2076576049| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2076576049} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2076576049|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2076576049, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2076576049} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 10:08:27,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1706967291 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1706967291 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1706967291 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1706967291 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1706967291|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1706967291 |P2Thread1of1ForFork0_#t~ite41_Out1706967291|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1706967291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1706967291} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1706967291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1706967291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1706967291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1706967291, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1706967291|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 10:08:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1886088361 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1886088361 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1886088361|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1886088361| ~a$r_buff0_thd3~0_In1886088361)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1886088361} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1886088361, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1886088361, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1886088361|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:08:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1609626942 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1609626942 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1609626942 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1609626942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out1609626942| 0)) (and (= ~a$r_buff1_thd3~0_In1609626942 |P2Thread1of1ForFork0_#t~ite43_Out1609626942|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1609626942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609626942, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1609626942, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609626942} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1609626942|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1609626942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1609626942, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1609626942, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1609626942} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 10:08:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:08:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:08:27,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-988206060| |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-988206060 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-988206060 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|)) (and .cse0 (= ~a~0_In-988206060 |ULTIMATE.start_main_#t~ite47_Out-988206060|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} OutVars{~a~0=~a~0_In-988206060, ~a$w_buff1~0=~a$w_buff1~0_In-988206060, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-988206060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-988206060, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-988206060|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988206060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:08:27,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-886766154 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-886766154 256) 0))) (or (and (= ~a$w_buff0_used~0_In-886766154 |ULTIMATE.start_main_#t~ite49_Out-886766154|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-886766154|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-886766154, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-886766154} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-886766154, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-886766154|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-886766154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:08:27,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-95934758 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-95934758 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-95934758 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-95934758 256) 0))) (or (and (= ~a$w_buff1_used~0_In-95934758 |ULTIMATE.start_main_#t~ite50_Out-95934758|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-95934758|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-95934758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-95934758} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-95934758|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-95934758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-95934758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-95934758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-95934758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:08:27,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1468979203 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1468979203 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1468979203|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1468979203 |ULTIMATE.start_main_#t~ite51_Out1468979203|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1468979203, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468979203} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1468979203|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1468979203, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1468979203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:08:27,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-854313214 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-854313214 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-854313214 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-854313214 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-854313214| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-854313214| ~a$r_buff1_thd0~0_In-854313214)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-854313214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-854313214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-854313214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-854313214} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-854313214|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-854313214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-854313214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-854313214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-854313214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:08:27,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:27,696 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_747343bb-d125-423d-9430-a02c18b388b0/bin/uautomizer/witness.graphml [2019-12-07 10:08:27,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:27,698 INFO L168 Benchmark]: Toolchain (without parser) took 58079.80 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 935.5 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:27,698 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:27,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:27,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.13 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 10:08:27,699 INFO L168 Benchmark]: Boogie Preprocessor took 26.16 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 10:08:27,699 INFO L168 Benchmark]: RCFGBuilder took 405.50 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:27,699 INFO L168 Benchmark]: TraceAbstraction took 57125.15 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:27,699 INFO L168 Benchmark]: Witness Printer took 68.62 ms. Allocated memory is still 5.9 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:27,701 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 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.16 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 405.50 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57125.15 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 68.62 ms. Allocated memory is still 5.9 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.9s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4273 SDtfs, 4166 SDslu, 10081 SDs, 0 SdLazy, 4935 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 35 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 130908 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 110688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...