./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/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 a5701852ce90a84820ef89cf6ce7497687cba636 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:08:54,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:08:54,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:08:54,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:08:54,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:08:54,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:08:54,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:08:54,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:08:54,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:08:54,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:08:54,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:08:54,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:08:54,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:08:54,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:08:54,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:08:54,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:08:54,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:08:54,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:08:54,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:08:54,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:08:54,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:08:54,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:08:54,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:08:54,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:08:54,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:08:54,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:08:54,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:08:54,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:08:54,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:08:54,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:08:54,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:08:54,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:08:54,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:08:54,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:08:54,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:08:54,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:08:54,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:08:54,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:08:54,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:08:54,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:08:54,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:08:54,781 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:08:54,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:08:54,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:08:54,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:08:54,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:08:54,795 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:08:54,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:08:54,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:08:54,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:08:54,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:08:54,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:08:54,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:08:54,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:08:54,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:08:54,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:08:54,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:08:54,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:08:54,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:08:54,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:08:54,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:08:54,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:08:54,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:08:54,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:08:54,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:08:54,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:08:54,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:08:54,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:08:54,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:08:54,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:08:54,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:08:54,799 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_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/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 -> a5701852ce90a84820ef89cf6ce7497687cba636 [2019-12-07 10:08:54,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:08:54,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:08:54,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:08:54,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:08:54,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:08:54,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix003_power.opt.i [2019-12-07 10:08:54,963 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/data/5049d0e73/e7d7f1a9f7b24694a05d0a4c8f26e636/FLAG98ec37a3e [2019-12-07 10:08:55,327 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:08:55,328 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/sv-benchmarks/c/pthread-wmm/mix003_power.opt.i [2019-12-07 10:08:55,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/data/5049d0e73/e7d7f1a9f7b24694a05d0a4c8f26e636/FLAG98ec37a3e [2019-12-07 10:08:55,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/data/5049d0e73/e7d7f1a9f7b24694a05d0a4c8f26e636 [2019-12-07 10:08:55,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:08:55,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:08:55,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:08:55,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:08:55,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:08:55,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e485e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55, skipping insertion in model container [2019-12-07 10:08:55,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:08:55,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:08:55,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:08:55,701 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:08:55,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:08:55,791 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:08:55,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55 WrapperNode [2019-12-07 10:08:55,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:08:55,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:08:55,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:08:55,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:08:55,798 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:08:55" (1/1) ... [2019-12-07 10:08:55,812 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:08:55" (1/1) ... [2019-12-07 10:08:55,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:08:55,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:08:55,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:08:55,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:08:55,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... [2019-12-07 10:08:55,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:08:55,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:08:55,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:08:55,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:08:55,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/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:08:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:08:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:08:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:08:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:08:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:08:55,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:08:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:08:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:08:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:08:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:08:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:08:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:08:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:08:55,907 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:08:56,321 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:08:56,321 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:08:56,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:56 BoogieIcfgContainer [2019-12-07 10:08:56,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:08:56,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:08:56,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:08:56,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:08:56,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:08:55" (1/3) ... [2019-12-07 10:08:56,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3766e26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:56, skipping insertion in model container [2019-12-07 10:08:56,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:55" (2/3) ... [2019-12-07 10:08:56,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3766e26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:56, skipping insertion in model container [2019-12-07 10:08:56,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:56" (3/3) ... [2019-12-07 10:08:56,327 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.opt.i [2019-12-07 10:08:56,333 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:08:56,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:08:56,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:08:56,338 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:08:56,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,382 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:08:56,406 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:08:56,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:08:56,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:08:56,418 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:08:56,418 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:08:56,418 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:08:56,418 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:08:56,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:08:56,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:08:56,429 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 10:08:56,430 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 10:08:56,491 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 10:08:56,491 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:08:56,504 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:08:56,527 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 10:08:56,561 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 10:08:56,562 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:08:56,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:08:56,593 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 10:08:56,594 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:09:00,047 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 10:09:00,217 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-07 10:09:00,218 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 10:09:00,220 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 10:09:02,864 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 10:09:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 10:09:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:09:02,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:02,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:02,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-07 10:09:02,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:02,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876373926] [2019-12-07 10:09:02,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:03,044 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:09:03,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876373926] [2019-12-07 10:09:03,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:03,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:09:03,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155524468] [2019-12-07 10:09:03,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:03,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:03,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:03,059 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 10:09:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:03,495 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-07 10:09:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:03,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:09:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:03,749 INFO L225 Difference]: With dead ends: 41734 [2019-12-07 10:09:03,750 INFO L226 Difference]: Without dead ends: 38878 [2019-12-07 10:09:03,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-07 10:09:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-07 10:09:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-07 10:09:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-07 10:09:05,199 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-07 10:09:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:05,200 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-07 10:09:05,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-07 10:09:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:09:05,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:05,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:05,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-07 10:09:05,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:05,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088176548] [2019-12-07 10:09:05,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:05,264 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:09:05,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088176548] [2019-12-07 10:09:05,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:05,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:05,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513493696] [2019-12-07 10:09:05,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:05,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:05,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:05,266 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 4 states. [2019-12-07 10:09:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:05,868 INFO L93 Difference]: Finished difference Result 61934 states and 244684 transitions. [2019-12-07 10:09:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:05,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:09:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:06,117 INFO L225 Difference]: With dead ends: 61934 [2019-12-07 10:09:06,117 INFO L226 Difference]: Without dead ends: 61902 [2019-12-07 10:09:06,118 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:09:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61902 states. [2019-12-07 10:09:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61902 to 60256. [2019-12-07 10:09:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60256 states. [2019-12-07 10:09:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60256 states to 60256 states and 239489 transitions. [2019-12-07 10:09:07,825 INFO L78 Accepts]: Start accepts. Automaton has 60256 states and 239489 transitions. Word has length 13 [2019-12-07 10:09:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 60256 states and 239489 transitions. [2019-12-07 10:09:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 60256 states and 239489 transitions. [2019-12-07 10:09:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:09:07,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:07,830 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:09:07,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-07 10:09:07,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:07,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835183876] [2019-12-07 10:09:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:07,875 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:09:07,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835183876] [2019-12-07 10:09:07,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:07,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:07,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568499541] [2019-12-07 10:09:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:07,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:07,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:07,877 INFO L87 Difference]: Start difference. First operand 60256 states and 239489 transitions. Second operand 4 states. [2019-12-07 10:09:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:08,482 INFO L93 Difference]: Finished difference Result 76784 states and 300751 transitions. [2019-12-07 10:09:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:09:08,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:09:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:08,658 INFO L225 Difference]: With dead ends: 76784 [2019-12-07 10:09:08,659 INFO L226 Difference]: Without dead ends: 76756 [2019-12-07 10:09:08,659 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:09:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76756 states. [2019-12-07 10:09:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76756 to 68490. [2019-12-07 10:09:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68490 states. [2019-12-07 10:09:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68490 states to 68490 states and 270892 transitions. [2019-12-07 10:09:11,546 INFO L78 Accepts]: Start accepts. Automaton has 68490 states and 270892 transitions. Word has length 16 [2019-12-07 10:09:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:11,546 INFO L462 AbstractCegarLoop]: Abstraction has 68490 states and 270892 transitions. [2019-12-07 10:09:11,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68490 states and 270892 transitions. [2019-12-07 10:09:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:09:11,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:11,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:11,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash 523730593, now seen corresponding path program 1 times [2019-12-07 10:09:11,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:11,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602964531] [2019-12-07 10:09:11,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:11,619 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:09:11,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602964531] [2019-12-07 10:09:11,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:11,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:09:11,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056322939] [2019-12-07 10:09:11,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:11,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:11,621 INFO L87 Difference]: Start difference. First operand 68490 states and 270892 transitions. Second operand 3 states. [2019-12-07 10:09:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:11,914 INFO L93 Difference]: Finished difference Result 68520 states and 270829 transitions. [2019-12-07 10:09:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:11,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:09:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:12,267 INFO L225 Difference]: With dead ends: 68520 [2019-12-07 10:09:12,267 INFO L226 Difference]: Without dead ends: 68520 [2019-12-07 10:09:12,267 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:09:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68520 states. [2019-12-07 10:09:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68520 to 68431. [2019-12-07 10:09:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-12-07 10:09:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 270638 transitions. [2019-12-07 10:09:13,960 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 270638 transitions. Word has length 18 [2019-12-07 10:09:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:13,960 INFO L462 AbstractCegarLoop]: Abstraction has 68431 states and 270638 transitions. [2019-12-07 10:09:13,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 270638 transitions. [2019-12-07 10:09:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:09:13,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:13,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:13,968 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 353080702, now seen corresponding path program 1 times [2019-12-07 10:09:13,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:13,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286675999] [2019-12-07 10:09:13,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:14,027 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:09:14,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286675999] [2019-12-07 10:09:14,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:14,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:14,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429048909] [2019-12-07 10:09:14,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:14,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:14,028 INFO L87 Difference]: Start difference. First operand 68431 states and 270638 transitions. Second operand 4 states. [2019-12-07 10:09:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:14,470 INFO L93 Difference]: Finished difference Result 64366 states and 254176 transitions. [2019-12-07 10:09:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:14,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:09:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:14,613 INFO L225 Difference]: With dead ends: 64366 [2019-12-07 10:09:14,613 INFO L226 Difference]: Without dead ends: 64366 [2019-12-07 10:09:14,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64366 states. [2019-12-07 10:09:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64366 to 64366. [2019-12-07 10:09:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64366 states. [2019-12-07 10:09:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64366 states to 64366 states and 254176 transitions. [2019-12-07 10:09:16,535 INFO L78 Accepts]: Start accepts. Automaton has 64366 states and 254176 transitions. Word has length 19 [2019-12-07 10:09:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:16,535 INFO L462 AbstractCegarLoop]: Abstraction has 64366 states and 254176 transitions. [2019-12-07 10:09:16,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 64366 states and 254176 transitions. [2019-12-07 10:09:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:09:16,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:16,549 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:09:16,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1555300184, now seen corresponding path program 1 times [2019-12-07 10:09:16,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:16,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128348728] [2019-12-07 10:09:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:16,593 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:09:16,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128348728] [2019-12-07 10:09:16,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:16,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:16,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889508415] [2019-12-07 10:09:16,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:16,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:16,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:16,595 INFO L87 Difference]: Start difference. First operand 64366 states and 254176 transitions. Second operand 5 states. [2019-12-07 10:09:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:17,236 INFO L93 Difference]: Finished difference Result 77220 states and 300575 transitions. [2019-12-07 10:09:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:09:17,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:09:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:17,406 INFO L225 Difference]: With dead ends: 77220 [2019-12-07 10:09:17,406 INFO L226 Difference]: Without dead ends: 77168 [2019-12-07 10:09:17,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:09:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77168 states. [2019-12-07 10:09:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77168 to 63926. [2019-12-07 10:09:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63926 states. [2019-12-07 10:09:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63926 states to 63926 states and 252592 transitions. [2019-12-07 10:09:20,560 INFO L78 Accepts]: Start accepts. Automaton has 63926 states and 252592 transitions. Word has length 22 [2019-12-07 10:09:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:20,561 INFO L462 AbstractCegarLoop]: Abstraction has 63926 states and 252592 transitions. [2019-12-07 10:09:20,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 63926 states and 252592 transitions. [2019-12-07 10:09:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:09:20,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:20,623 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] [2019-12-07 10:09:20,624 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:20,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2015464469, now seen corresponding path program 1 times [2019-12-07 10:09:20,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:20,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392901338] [2019-12-07 10:09:20,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:20,682 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:09:20,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392901338] [2019-12-07 10:09:20,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:20,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:20,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957781198] [2019-12-07 10:09:20,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:20,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:20,684 INFO L87 Difference]: Start difference. First operand 63926 states and 252592 transitions. Second operand 4 states. [2019-12-07 10:09:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:20,940 INFO L93 Difference]: Finished difference Result 63874 states and 252412 transitions. [2019-12-07 10:09:20,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:20,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 10:09:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:21,092 INFO L225 Difference]: With dead ends: 63874 [2019-12-07 10:09:21,093 INFO L226 Difference]: Without dead ends: 63874 [2019-12-07 10:09:21,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63874 states. [2019-12-07 10:09:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63874 to 63874. [2019-12-07 10:09:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63874 states. [2019-12-07 10:09:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63874 states to 63874 states and 252412 transitions. [2019-12-07 10:09:22,717 INFO L78 Accepts]: Start accepts. Automaton has 63874 states and 252412 transitions. Word has length 32 [2019-12-07 10:09:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:22,717 INFO L462 AbstractCegarLoop]: Abstraction has 63874 states and 252412 transitions. [2019-12-07 10:09:22,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 63874 states and 252412 transitions. [2019-12-07 10:09:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:09:22,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:22,778 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:09:22,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:22,778 INFO L82 PathProgramCache]: Analyzing trace with hash -493132648, now seen corresponding path program 1 times [2019-12-07 10:09:22,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:22,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15374039] [2019-12-07 10:09:22,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:22,818 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:09:22,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15374039] [2019-12-07 10:09:22,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:22,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:22,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071048878] [2019-12-07 10:09:22,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:09:22,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:09:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:09:22,819 INFO L87 Difference]: Start difference. First operand 63874 states and 252412 transitions. Second operand 4 states. [2019-12-07 10:09:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:23,578 INFO L93 Difference]: Finished difference Result 116176 states and 459347 transitions. [2019-12-07 10:09:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:09:23,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 10:09:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:23,845 INFO L225 Difference]: With dead ends: 116176 [2019-12-07 10:09:23,845 INFO L226 Difference]: Without dead ends: 116176 [2019-12-07 10:09:23,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:09:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116176 states. [2019-12-07 10:09:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116176 to 91942. [2019-12-07 10:09:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91942 states. [2019-12-07 10:09:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91942 states to 91942 states and 367946 transitions. [2019-12-07 10:09:26,765 INFO L78 Accepts]: Start accepts. Automaton has 91942 states and 367946 transitions. Word has length 33 [2019-12-07 10:09:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:26,766 INFO L462 AbstractCegarLoop]: Abstraction has 91942 states and 367946 transitions. [2019-12-07 10:09:26,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 91942 states and 367946 transitions. [2019-12-07 10:09:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:09:26,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:26,856 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:09:26,856 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:26,856 INFO L82 PathProgramCache]: Analyzing trace with hash 734357034, now seen corresponding path program 2 times [2019-12-07 10:09:26,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:26,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976215321] [2019-12-07 10:09:26,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:26,889 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:09:26,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976215321] [2019-12-07 10:09:26,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:26,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:09:26,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040728313] [2019-12-07 10:09:26,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:26,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:26,890 INFO L87 Difference]: Start difference. First operand 91942 states and 367946 transitions. Second operand 3 states. [2019-12-07 10:09:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:27,259 INFO L93 Difference]: Finished difference Result 91582 states and 361462 transitions. [2019-12-07 10:09:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:27,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 10:09:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:27,457 INFO L225 Difference]: With dead ends: 91582 [2019-12-07 10:09:27,457 INFO L226 Difference]: Without dead ends: 91582 [2019-12-07 10:09:27,457 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:09:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91582 states. [2019-12-07 10:09:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91582 to 91326. [2019-12-07 10:09:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91326 states. [2019-12-07 10:09:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91326 states to 91326 states and 360622 transitions. [2019-12-07 10:09:29,676 INFO L78 Accepts]: Start accepts. Automaton has 91326 states and 360622 transitions. Word has length 33 [2019-12-07 10:09:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:29,676 INFO L462 AbstractCegarLoop]: Abstraction has 91326 states and 360622 transitions. [2019-12-07 10:09:29,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:09:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 91326 states and 360622 transitions. [2019-12-07 10:09:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:09:30,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:30,101 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] [2019-12-07 10:09:30,101 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 720627130, now seen corresponding path program 1 times [2019-12-07 10:09:30,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:30,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430425457] [2019-12-07 10:09:30,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:30,158 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:09:30,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430425457] [2019-12-07 10:09:30,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:30,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95210088] [2019-12-07 10:09:30,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:30,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:30,159 INFO L87 Difference]: Start difference. First operand 91326 states and 360622 transitions. Second operand 5 states. [2019-12-07 10:09:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:30,867 INFO L93 Difference]: Finished difference Result 139468 states and 555462 transitions. [2019-12-07 10:09:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:09:30,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:09:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:31,200 INFO L225 Difference]: With dead ends: 139468 [2019-12-07 10:09:31,200 INFO L226 Difference]: Without dead ends: 139468 [2019-12-07 10:09:31,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139468 states. [2019-12-07 10:09:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139468 to 132394. [2019-12-07 10:09:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132394 states. [2019-12-07 10:09:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132394 states to 132394 states and 529726 transitions. [2019-12-07 10:09:36,384 INFO L78 Accepts]: Start accepts. Automaton has 132394 states and 529726 transitions. Word has length 34 [2019-12-07 10:09:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:36,384 INFO L462 AbstractCegarLoop]: Abstraction has 132394 states and 529726 transitions. [2019-12-07 10:09:36,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 132394 states and 529726 transitions. [2019-12-07 10:09:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:09:36,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:36,519 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] [2019-12-07 10:09:36,519 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1501691134, now seen corresponding path program 2 times [2019-12-07 10:09:36,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:36,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012048464] [2019-12-07 10:09:36,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:36,588 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:09:36,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012048464] [2019-12-07 10:09:36,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:36,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:36,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935560795] [2019-12-07 10:09:36,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:09:36,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:09:36,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:36,590 INFO L87 Difference]: Start difference. First operand 132394 states and 529726 transitions. Second operand 7 states. [2019-12-07 10:09:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:37,719 INFO L93 Difference]: Finished difference Result 214182 states and 849748 transitions. [2019-12-07 10:09:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:09:37,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 10:09:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:38,230 INFO L225 Difference]: With dead ends: 214182 [2019-12-07 10:09:38,230 INFO L226 Difference]: Without dead ends: 197022 [2019-12-07 10:09:38,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:09:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197022 states. [2019-12-07 10:09:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197022 to 169688. [2019-12-07 10:09:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169688 states. [2019-12-07 10:09:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169688 states to 169688 states and 680341 transitions. [2019-12-07 10:09:42,757 INFO L78 Accepts]: Start accepts. Automaton has 169688 states and 680341 transitions. Word has length 34 [2019-12-07 10:09:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:42,757 INFO L462 AbstractCegarLoop]: Abstraction has 169688 states and 680341 transitions. [2019-12-07 10:09:42,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:09:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 169688 states and 680341 transitions. [2019-12-07 10:09:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:09:42,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:42,953 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] [2019-12-07 10:09:42,953 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1948116812, now seen corresponding path program 3 times [2019-12-07 10:09:42,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10546782] [2019-12-07 10:09:42,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,048 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:09:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10546782] [2019-12-07 10:09:43,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:43,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194097925] [2019-12-07 10:09:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:09:43,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:09:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:09:43,049 INFO L87 Difference]: Start difference. First operand 169688 states and 680341 transitions. Second operand 8 states. [2019-12-07 10:09:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:45,871 INFO L93 Difference]: Finished difference Result 311570 states and 1245369 transitions. [2019-12-07 10:09:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:09:45,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 10:09:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:46,672 INFO L225 Difference]: With dead ends: 311570 [2019-12-07 10:09:46,672 INFO L226 Difference]: Without dead ends: 311570 [2019-12-07 10:09:46,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:09:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311570 states. [2019-12-07 10:09:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311570 to 194350. [2019-12-07 10:09:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194350 states. [2019-12-07 10:09:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194350 states to 194350 states and 776890 transitions. [2019-12-07 10:09:55,147 INFO L78 Accepts]: Start accepts. Automaton has 194350 states and 776890 transitions. Word has length 34 [2019-12-07 10:09:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:55,148 INFO L462 AbstractCegarLoop]: Abstraction has 194350 states and 776890 transitions. [2019-12-07 10:09:55,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:09:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 194350 states and 776890 transitions. [2019-12-07 10:09:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:09:55,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:55,378 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] [2019-12-07 10:09:55,379 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:09:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1614811714, now seen corresponding path program 4 times [2019-12-07 10:09:55,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:55,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242286005] [2019-12-07 10:09:55,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:55,487 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:09:55,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242286005] [2019-12-07 10:09:55,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:55,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:09:55,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652966507] [2019-12-07 10:09:55,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:09:55,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:09:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:55,489 INFO L87 Difference]: Start difference. First operand 194350 states and 776890 transitions. Second operand 9 states. [2019-12-07 10:09:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:58,644 INFO L93 Difference]: Finished difference Result 356326 states and 1420657 transitions. [2019-12-07 10:09:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:09:58,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 10:09:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:59,604 INFO L225 Difference]: With dead ends: 356326 [2019-12-07 10:09:59,604 INFO L226 Difference]: Without dead ends: 356326 [2019-12-07 10:09:59,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:10:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356326 states. [2019-12-07 10:10:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356326 to 198322. [2019-12-07 10:10:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198322 states. [2019-12-07 10:10:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198322 states to 198322 states and 793628 transitions. [2019-12-07 10:10:09,396 INFO L78 Accepts]: Start accepts. Automaton has 198322 states and 793628 transitions. Word has length 34 [2019-12-07 10:10:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:09,396 INFO L462 AbstractCegarLoop]: Abstraction has 198322 states and 793628 transitions. [2019-12-07 10:10:09,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:10:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 198322 states and 793628 transitions. [2019-12-07 10:10:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:10:09,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:09,635 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] [2019-12-07 10:10:09,636 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1720313958, now seen corresponding path program 5 times [2019-12-07 10:10:09,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:09,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525601163] [2019-12-07 10:10:09,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:09,737 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:10:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525601163] [2019-12-07 10:10:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:10:09,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285425092] [2019-12-07 10:10:09,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:10:09,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:10:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:10:09,739 INFO L87 Difference]: Start difference. First operand 198322 states and 793628 transitions. Second operand 9 states. [2019-12-07 10:10:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:12,657 INFO L93 Difference]: Finished difference Result 380856 states and 1525871 transitions. [2019-12-07 10:10:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 10:10:12,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 10:10:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:13,666 INFO L225 Difference]: With dead ends: 380856 [2019-12-07 10:10:13,666 INFO L226 Difference]: Without dead ends: 380856 [2019-12-07 10:10:13,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:10:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380856 states. [2019-12-07 10:10:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380856 to 202624. [2019-12-07 10:10:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202624 states. [2019-12-07 10:10:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202624 states to 202624 states and 811955 transitions. [2019-12-07 10:10:21,526 INFO L78 Accepts]: Start accepts. Automaton has 202624 states and 811955 transitions. Word has length 34 [2019-12-07 10:10:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:21,526 INFO L462 AbstractCegarLoop]: Abstraction has 202624 states and 811955 transitions. [2019-12-07 10:10:21,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:10:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 202624 states and 811955 transitions. [2019-12-07 10:10:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:10:21,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:21,769 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] [2019-12-07 10:10:21,769 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1491901500, now seen corresponding path program 6 times [2019-12-07 10:10:21,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:21,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730935859] [2019-12-07 10:10:21,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:21,835 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:10:21,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730935859] [2019-12-07 10:10:21,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:21,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:10:21,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864481670] [2019-12-07 10:10:21,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:10:21,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:10:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:10:21,836 INFO L87 Difference]: Start difference. First operand 202624 states and 811955 transitions. Second operand 6 states. [2019-12-07 10:10:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:22,997 INFO L93 Difference]: Finished difference Result 252176 states and 1007399 transitions. [2019-12-07 10:10:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:10:22,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:10:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:26,221 INFO L225 Difference]: With dead ends: 252176 [2019-12-07 10:10:26,221 INFO L226 Difference]: Without dead ends: 225598 [2019-12-07 10:10:26,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:10:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225598 states. [2019-12-07 10:10:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225598 to 202018. [2019-12-07 10:10:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202018 states. [2019-12-07 10:10:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202018 states to 202018 states and 806694 transitions. [2019-12-07 10:10:31,389 INFO L78 Accepts]: Start accepts. Automaton has 202018 states and 806694 transitions. Word has length 34 [2019-12-07 10:10:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:31,389 INFO L462 AbstractCegarLoop]: Abstraction has 202018 states and 806694 transitions. [2019-12-07 10:10:31,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:10:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 202018 states and 806694 transitions. [2019-12-07 10:10:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:10:31,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:31,629 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] [2019-12-07 10:10:31,629 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1885038844, now seen corresponding path program 7 times [2019-12-07 10:10:31,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:31,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462389667] [2019-12-07 10:10:31,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:31,820 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:10:31,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462389667] [2019-12-07 10:10:31,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:31,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:10:31,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810707131] [2019-12-07 10:10:31,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:10:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:31,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:10:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:10:31,821 INFO L87 Difference]: Start difference. First operand 202018 states and 806694 transitions. Second operand 13 states. [2019-12-07 10:10:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:35,659 INFO L93 Difference]: Finished difference Result 338454 states and 1357332 transitions. [2019-12-07 10:10:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 10:10:35,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-12-07 10:10:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:36,452 INFO L225 Difference]: With dead ends: 338454 [2019-12-07 10:10:36,452 INFO L226 Difference]: Without dead ends: 318242 [2019-12-07 10:10:36,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:10:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318242 states. [2019-12-07 10:10:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318242 to 204246. [2019-12-07 10:10:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204246 states. [2019-12-07 10:10:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204246 states to 204246 states and 815732 transitions. [2019-12-07 10:10:42,859 INFO L78 Accepts]: Start accepts. Automaton has 204246 states and 815732 transitions. Word has length 34 [2019-12-07 10:10:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:42,860 INFO L462 AbstractCegarLoop]: Abstraction has 204246 states and 815732 transitions. [2019-12-07 10:10:42,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:10:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 204246 states and 815732 transitions. [2019-12-07 10:10:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:10:43,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:43,103 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] [2019-12-07 10:10:43,103 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1188268072, now seen corresponding path program 8 times [2019-12-07 10:10:43,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:43,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714083345] [2019-12-07 10:10:43,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:43,132 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:10:43,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714083345] [2019-12-07 10:10:43,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:43,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:10:43,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953221627] [2019-12-07 10:10:43,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:10:43,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:43,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:10:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:10:43,134 INFO L87 Difference]: Start difference. First operand 204246 states and 815732 transitions. Second operand 3 states. [2019-12-07 10:10:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:43,910 INFO L93 Difference]: Finished difference Result 109815 states and 383829 transitions. [2019-12-07 10:10:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:10:43,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 10:10:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:44,128 INFO L225 Difference]: With dead ends: 109815 [2019-12-07 10:10:44,128 INFO L226 Difference]: Without dead ends: 109815 [2019-12-07 10:10:44,128 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:10:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109815 states. [2019-12-07 10:10:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109815 to 109815. [2019-12-07 10:10:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109815 states. [2019-12-07 10:10:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109815 states to 109815 states and 383829 transitions. [2019-12-07 10:10:48,867 INFO L78 Accepts]: Start accepts. Automaton has 109815 states and 383829 transitions. Word has length 34 [2019-12-07 10:10:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:48,867 INFO L462 AbstractCegarLoop]: Abstraction has 109815 states and 383829 transitions. [2019-12-07 10:10:48,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:10:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 109815 states and 383829 transitions. [2019-12-07 10:10:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:10:48,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:48,971 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:10:48,971 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1028049739, now seen corresponding path program 1 times [2019-12-07 10:10:48,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:48,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423967907] [2019-12-07 10:10:48,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:49,099 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:10:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423967907] [2019-12-07 10:10:49,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:49,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:10:49,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636030190] [2019-12-07 10:10:49,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:10:49,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:10:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:10:49,101 INFO L87 Difference]: Start difference. First operand 109815 states and 383829 transitions. Second operand 9 states. [2019-12-07 10:10:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:50,284 INFO L93 Difference]: Finished difference Result 232345 states and 810995 transitions. [2019-12-07 10:10:50,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:10:50,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 10:10:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:50,775 INFO L225 Difference]: With dead ends: 232345 [2019-12-07 10:10:50,775 INFO L226 Difference]: Without dead ends: 217181 [2019-12-07 10:10:50,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:10:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217181 states. [2019-12-07 10:10:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217181 to 104398. [2019-12-07 10:10:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104398 states. [2019-12-07 10:10:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104398 states to 104398 states and 363593 transitions. [2019-12-07 10:10:54,192 INFO L78 Accepts]: Start accepts. Automaton has 104398 states and 363593 transitions. Word has length 35 [2019-12-07 10:10:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:54,192 INFO L462 AbstractCegarLoop]: Abstraction has 104398 states and 363593 transitions. [2019-12-07 10:10:54,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:10:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 104398 states and 363593 transitions. [2019-12-07 10:10:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:10:54,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:54,291 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:10:54,291 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 23082343, now seen corresponding path program 2 times [2019-12-07 10:10:54,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:54,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224251706] [2019-12-07 10:10:54,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:54,317 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:10:54,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224251706] [2019-12-07 10:10:54,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:54,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:54,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70156433] [2019-12-07 10:10:54,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:10:54,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:54,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:10:54,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:10:54,319 INFO L87 Difference]: Start difference. First operand 104398 states and 363593 transitions. Second operand 4 states. [2019-12-07 10:10:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:54,357 INFO L93 Difference]: Finished difference Result 10517 states and 31282 transitions. [2019-12-07 10:10:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:10:54,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 10:10:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:54,369 INFO L225 Difference]: With dead ends: 10517 [2019-12-07 10:10:54,369 INFO L226 Difference]: Without dead ends: 10517 [2019-12-07 10:10:54,369 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:10:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10517 states. [2019-12-07 10:10:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10517 to 10509. [2019-12-07 10:10:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10509 states. [2019-12-07 10:10:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10509 states to 10509 states and 31260 transitions. [2019-12-07 10:10:54,493 INFO L78 Accepts]: Start accepts. Automaton has 10509 states and 31260 transitions. Word has length 35 [2019-12-07 10:10:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:54,493 INFO L462 AbstractCegarLoop]: Abstraction has 10509 states and 31260 transitions. [2019-12-07 10:10:54,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:10:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10509 states and 31260 transitions. [2019-12-07 10:10:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:10:54,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:54,502 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] [2019-12-07 10:10:54,502 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1596603272, now seen corresponding path program 1 times [2019-12-07 10:10:54,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:54,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416242397] [2019-12-07 10:10:54,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:54,558 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:10:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416242397] [2019-12-07 10:10:54,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:54,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:54,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055813060] [2019-12-07 10:10:54,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:10:54,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:10:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:10:54,559 INFO L87 Difference]: Start difference. First operand 10509 states and 31260 transitions. Second operand 4 states. [2019-12-07 10:10:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:54,611 INFO L93 Difference]: Finished difference Result 11692 states and 34002 transitions. [2019-12-07 10:10:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:10:54,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 10:10:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:54,623 INFO L225 Difference]: With dead ends: 11692 [2019-12-07 10:10:54,624 INFO L226 Difference]: Without dead ends: 11486 [2019-12-07 10:10:54,624 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:10:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2019-12-07 10:10:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 11333. [2019-12-07 10:10:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11333 states. [2019-12-07 10:10:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11333 states to 11333 states and 33313 transitions. [2019-12-07 10:10:54,758 INFO L78 Accepts]: Start accepts. Automaton has 11333 states and 33313 transitions. Word has length 47 [2019-12-07 10:10:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:54,758 INFO L462 AbstractCegarLoop]: Abstraction has 11333 states and 33313 transitions. [2019-12-07 10:10:54,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:10:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11333 states and 33313 transitions. [2019-12-07 10:10:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:10:54,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:54,768 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] [2019-12-07 10:10:54,768 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash -44720358, now seen corresponding path program 2 times [2019-12-07 10:10:54,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:54,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922994439] [2019-12-07 10:10:54,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:54,944 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:10:54,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922994439] [2019-12-07 10:10:54,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:54,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:10:54,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184280311] [2019-12-07 10:10:54,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:10:54,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:10:54,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:10:54,946 INFO L87 Difference]: Start difference. First operand 11333 states and 33313 transitions. Second operand 10 states. [2019-12-07 10:10:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:55,453 INFO L93 Difference]: Finished difference Result 15912 states and 44895 transitions. [2019-12-07 10:10:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:10:55,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-12-07 10:10:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:55,467 INFO L225 Difference]: With dead ends: 15912 [2019-12-07 10:10:55,467 INFO L226 Difference]: Without dead ends: 13472 [2019-12-07 10:10:55,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:10:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13472 states. [2019-12-07 10:10:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13472 to 10154. [2019-12-07 10:10:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10154 states. [2019-12-07 10:10:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10154 states to 10154 states and 30425 transitions. [2019-12-07 10:10:55,605 INFO L78 Accepts]: Start accepts. Automaton has 10154 states and 30425 transitions. Word has length 47 [2019-12-07 10:10:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:55,605 INFO L462 AbstractCegarLoop]: Abstraction has 10154 states and 30425 transitions. [2019-12-07 10:10:55,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:10:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 10154 states and 30425 transitions. [2019-12-07 10:10:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:10:55,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:55,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:10:55,615 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1138071248, now seen corresponding path program 3 times [2019-12-07 10:10:55,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:55,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461106499] [2019-12-07 10:10:55,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:55,666 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:10:55,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461106499] [2019-12-07 10:10:55,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:55,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:55,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073240292] [2019-12-07 10:10:55,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:10:55,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:10:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:10:55,667 INFO L87 Difference]: Start difference. First operand 10154 states and 30425 transitions. Second operand 4 states. [2019-12-07 10:10:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:55,725 INFO L93 Difference]: Finished difference Result 15476 states and 44014 transitions. [2019-12-07 10:10:55,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:10:55,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 10:10:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:55,742 INFO L225 Difference]: With dead ends: 15476 [2019-12-07 10:10:55,742 INFO L226 Difference]: Without dead ends: 15222 [2019-12-07 10:10:55,742 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:10:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15222 states. [2019-12-07 10:10:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15222 to 10852. [2019-12-07 10:10:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2019-12-07 10:10:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 32081 transitions. [2019-12-07 10:10:55,895 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 32081 transitions. Word has length 47 [2019-12-07 10:10:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:55,896 INFO L462 AbstractCegarLoop]: Abstraction has 10852 states and 32081 transitions. [2019-12-07 10:10:55,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:10:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 32081 transitions. [2019-12-07 10:10:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:10:55,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:55,905 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] [2019-12-07 10:10:55,905 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -160832526, now seen corresponding path program 4 times [2019-12-07 10:10:55,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:55,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251648295] [2019-12-07 10:10:55,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:55,951 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:10:55,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251648295] [2019-12-07 10:10:55,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:55,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:10:55,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172774418] [2019-12-07 10:10:55,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:55,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:55,952 INFO L87 Difference]: Start difference. First operand 10852 states and 32081 transitions. Second operand 5 states. [2019-12-07 10:10:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:55,984 INFO L93 Difference]: Finished difference Result 8877 states and 27521 transitions. [2019-12-07 10:10:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:10:55,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 10:10:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:55,988 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 10:10:55,988 INFO L226 Difference]: Without dead ends: 3774 [2019-12-07 10:10:55,988 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:10:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2019-12-07 10:10:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3393. [2019-12-07 10:10:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3393 states. [2019-12-07 10:10:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 9133 transitions. [2019-12-07 10:10:56,023 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 9133 transitions. Word has length 47 [2019-12-07 10:10:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:56,023 INFO L462 AbstractCegarLoop]: Abstraction has 3393 states and 9133 transitions. [2019-12-07 10:10:56,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:10:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 9133 transitions. [2019-12-07 10:10:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:10:56,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:56,025 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] [2019-12-07 10:10:56,026 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:56,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash 292970337, now seen corresponding path program 1 times [2019-12-07 10:10:56,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:56,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156874758] [2019-12-07 10:10:56,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:56,251 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:10:56,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156874758] [2019-12-07 10:10:56,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:56,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:10:56,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223090648] [2019-12-07 10:10:56,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:10:56,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:10:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:10:56,252 INFO L87 Difference]: Start difference. First operand 3393 states and 9133 transitions. Second operand 12 states. [2019-12-07 10:10:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:58,222 INFO L93 Difference]: Finished difference Result 9298 states and 25006 transitions. [2019-12-07 10:10:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:10:58,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-07 10:10:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:58,236 INFO L225 Difference]: With dead ends: 9298 [2019-12-07 10:10:58,236 INFO L226 Difference]: Without dead ends: 8470 [2019-12-07 10:10:58,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:10:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2019-12-07 10:10:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 5704. [2019-12-07 10:10:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-12-07 10:10:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 15401 transitions. [2019-12-07 10:10:58,317 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 15401 transitions. Word has length 62 [2019-12-07 10:10:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:58,317 INFO L462 AbstractCegarLoop]: Abstraction has 5704 states and 15401 transitions. [2019-12-07 10:10:58,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:10:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 15401 transitions. [2019-12-07 10:10:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:10:58,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:58,322 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] [2019-12-07 10:10:58,322 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:10:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1419923269, now seen corresponding path program 2 times [2019-12-07 10:10:58,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:58,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094607229] [2019-12-07 10:10:58,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:58,467 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:10:58,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094607229] [2019-12-07 10:10:58,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:10:58,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317644228] [2019-12-07 10:10:58,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:10:58,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:10:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:10:58,468 INFO L87 Difference]: Start difference. First operand 5704 states and 15401 transitions. Second operand 13 states. [2019-12-07 10:11:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:00,093 INFO L93 Difference]: Finished difference Result 16331 states and 44260 transitions. [2019-12-07 10:11:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:11:00,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 10:11:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:00,129 INFO L225 Difference]: With dead ends: 16331 [2019-12-07 10:11:00,129 INFO L226 Difference]: Without dead ends: 15880 [2019-12-07 10:11:00,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:11:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2019-12-07 10:11:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 5787. [2019-12-07 10:11:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-12-07 10:11:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 15607 transitions. [2019-12-07 10:11:00,247 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 15607 transitions. Word has length 62 [2019-12-07 10:11:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:00,247 INFO L462 AbstractCegarLoop]: Abstraction has 5787 states and 15607 transitions. [2019-12-07 10:11:00,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:11:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 15607 transitions. [2019-12-07 10:11:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:11:00,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:00,252 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] [2019-12-07 10:11:00,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1167865063, now seen corresponding path program 3 times [2019-12-07 10:11:00,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:00,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614956153] [2019-12-07 10:11:00,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:00,301 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:11:00,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614956153] [2019-12-07 10:11:00,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:00,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:11:00,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939428198] [2019-12-07 10:11:00,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:11:00,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:11:00,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:11:00,302 INFO L87 Difference]: Start difference. First operand 5787 states and 15607 transitions. Second operand 8 states. [2019-12-07 10:11:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:00,511 INFO L93 Difference]: Finished difference Result 11285 states and 30380 transitions. [2019-12-07 10:11:00,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:11:00,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-07 10:11:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:00,520 INFO L225 Difference]: With dead ends: 11285 [2019-12-07 10:11:00,520 INFO L226 Difference]: Without dead ends: 9489 [2019-12-07 10:11:00,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:11:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9489 states. [2019-12-07 10:11:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9489 to 8139. [2019-12-07 10:11:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8139 states. [2019-12-07 10:11:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8139 states to 8139 states and 21925 transitions. [2019-12-07 10:11:00,616 INFO L78 Accepts]: Start accepts. Automaton has 8139 states and 21925 transitions. Word has length 62 [2019-12-07 10:11:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:00,616 INFO L462 AbstractCegarLoop]: Abstraction has 8139 states and 21925 transitions. [2019-12-07 10:11:00,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:11:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8139 states and 21925 transitions. [2019-12-07 10:11:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:11:00,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:00,623 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] [2019-12-07 10:11:00,623 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2088201467, now seen corresponding path program 4 times [2019-12-07 10:11:00,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:00,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662101467] [2019-12-07 10:11:00,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:00,664 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:11:00,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662101467] [2019-12-07 10:11:00,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:00,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:11:00,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646385343] [2019-12-07 10:11:00,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:11:00,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:11:00,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:11:00,665 INFO L87 Difference]: Start difference. First operand 8139 states and 21925 transitions. Second operand 6 states. [2019-12-07 10:11:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:00,783 INFO L93 Difference]: Finished difference Result 11738 states and 31776 transitions. [2019-12-07 10:11:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:11:00,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 10:11:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:00,789 INFO L225 Difference]: With dead ends: 11738 [2019-12-07 10:11:00,789 INFO L226 Difference]: Without dead ends: 5888 [2019-12-07 10:11:00,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:11:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2019-12-07 10:11:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 4833. [2019-12-07 10:11:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-12-07 10:11:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 12942 transitions. [2019-12-07 10:11:00,847 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 12942 transitions. Word has length 62 [2019-12-07 10:11:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:00,847 INFO L462 AbstractCegarLoop]: Abstraction has 4833 states and 12942 transitions. [2019-12-07 10:11:00,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:11:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 12942 transitions. [2019-12-07 10:11:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:11:00,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:00,851 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] [2019-12-07 10:11:00,851 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -973470309, now seen corresponding path program 1 times [2019-12-07 10:11:00,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:00,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862901947] [2019-12-07 10:11:00,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:00,938 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:11:00,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862901947] [2019-12-07 10:11:00,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:00,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:11:00,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951279011] [2019-12-07 10:11:00,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:11:00,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:11:00,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:11:00,940 INFO L87 Difference]: Start difference. First operand 4833 states and 12942 transitions. Second operand 5 states. [2019-12-07 10:11:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:00,974 INFO L93 Difference]: Finished difference Result 5288 states and 14003 transitions. [2019-12-07 10:11:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:11:00,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 10:11:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:00,975 INFO L225 Difference]: With dead ends: 5288 [2019-12-07 10:11:00,975 INFO L226 Difference]: Without dead ends: 529 [2019-12-07 10:11:00,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:11:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-07 10:11:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-07 10:11:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 10:11:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1175 transitions. [2019-12-07 10:11:00,981 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1175 transitions. Word has length 63 [2019-12-07 10:11:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:00,982 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1175 transitions. [2019-12-07 10:11:00,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:11:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1175 transitions. [2019-12-07 10:11:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:11:00,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:00,983 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] [2019-12-07 10:11:00,983 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:11:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 2 times [2019-12-07 10:11:00,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:00,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243890645] [2019-12-07 10:11:00,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:11:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:11:01,058 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:11:01,058 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:11:01,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t65~0.base_69| 4) |v_#length_21|) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69|)) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t65~0.offset_41|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69|) |v_ULTIMATE.start_main_~#t65~0.offset_41| 0)) |v_#memory_int_19|) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t65~0.base_69|) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= |v_#valid_104| (store .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69| 1)) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t65~0.offset=|v_ULTIMATE.start_main_~#t65~0.offset_41|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t65~0.base=|v_ULTIMATE.start_main_~#t65~0.base_69|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_70|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_43|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t65~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t67~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t65~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t66~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t66~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t67~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:11:01,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t66~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12|) |v_ULTIMATE.start_main_~#t66~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t66~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t66~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t66~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_12|, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t66~0.base, ULTIMATE.start_main_~#t66~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:11:01,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11|) |v_ULTIMATE.start_main_~#t67~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t67~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t67~0.base_11| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t67~0.base_11| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t67~0.offset_9| 0) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t67~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t67~0.base, #length] because there is no mapped edge [2019-12-07 10:11:01,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:11:01,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In798412424 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In798412424 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out798412424| ~y$w_buff0~0_In798412424)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In798412424 |P2Thread1of1ForFork0_#t~ite28_Out798412424|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In798412424, ~y$w_buff1~0=~y$w_buff1~0_In798412424, ~y$w_buff0~0=~y$w_buff0~0_In798412424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In798412424} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out798412424|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In798412424, ~y$w_buff1~0=~y$w_buff1~0_In798412424, ~y$w_buff0~0=~y$w_buff0~0_In798412424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In798412424} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:11:01,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:11:01,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:11:01,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-808172338 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-808172338| ~y~0_In-808172338) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-808172338| ~y$mem_tmp~0_In-808172338)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-808172338, ~y$flush_delayed~0=~y$flush_delayed~0_In-808172338, ~y~0=~y~0_In-808172338} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-808172338|, ~y$mem_tmp~0=~y$mem_tmp~0_In-808172338, ~y$flush_delayed~0=~y$flush_delayed~0_In-808172338, ~y~0=~y~0_In-808172338} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:11:01,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:11:01,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-964260600 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-964260600| ~y$mem_tmp~0_In-964260600) (not .cse0)) (and .cse0 (= ~y~0_In-964260600 |P1Thread1of1ForFork2_#t~ite25_Out-964260600|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-964260600, ~y$flush_delayed~0=~y$flush_delayed~0_In-964260600, ~y~0=~y~0_In-964260600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-964260600, ~y$flush_delayed~0=~y$flush_delayed~0_In-964260600, ~y~0=~y~0_In-964260600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-964260600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:11:01,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:11:01,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In888035749 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In888035749 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out888035749|)) (and (= ~y$w_buff0_used~0_In888035749 |P2Thread1of1ForFork0_#t~ite51_Out888035749|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In888035749, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888035749} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In888035749, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888035749, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out888035749|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:11:01,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1080311541 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1080311541 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1080311541 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1080311541 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1080311541| ~y$w_buff1_used~0_In1080311541) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1080311541|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1080311541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1080311541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1080311541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080311541} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1080311541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1080311541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1080311541, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1080311541|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080311541} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:11:01,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-852958517 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-852958517 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-852958517 ~y$r_buff0_thd3~0_Out-852958517))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-852958517)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-852958517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-852958517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-852958517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-852958517, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-852958517|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:11:01,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-456475820 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-456475820 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-456475820 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-456475820 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-456475820| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-456475820| ~y$r_buff1_thd3~0_In-456475820)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-456475820, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-456475820, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456475820, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-456475820} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-456475820, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-456475820, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-456475820|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456475820, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-456475820} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:11:01,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:11:01,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:11:01,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1148787481 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1148787481 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out-1148787481| |ULTIMATE.start_main_#t~ite58_Out-1148787481|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1148787481 |ULTIMATE.start_main_#t~ite58_Out-1148787481|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-1148787481| ~y~0_In-1148787481) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1148787481, ~y~0=~y~0_In-1148787481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1148787481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1148787481} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1148787481, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1148787481|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1148787481|, ~y~0=~y~0_In-1148787481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1148787481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1148787481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:11:01,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2032140504 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2032140504 256) 0))) (or (and (= ~y$w_buff0_used~0_In2032140504 |ULTIMATE.start_main_#t~ite60_Out2032140504|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out2032140504| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2032140504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032140504} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2032140504|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2032140504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032140504} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:11:01,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1014953686 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1014953686 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1014953686 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1014953686 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1014953686|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1014953686| ~y$w_buff1_used~0_In1014953686) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1014953686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1014953686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1014953686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014953686} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1014953686|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1014953686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1014953686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1014953686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014953686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:11:01,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In512579161 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In512579161 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out512579161|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In512579161 |ULTIMATE.start_main_#t~ite62_Out512579161|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512579161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512579161} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out512579161|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In512579161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512579161} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:11:01,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-149600818 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-149600818 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-149600818 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-149600818 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-149600818| ~y$r_buff1_thd0~0_In-149600818) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite63_Out-149600818| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-149600818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149600818, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149600818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149600818} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-149600818|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-149600818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149600818, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149600818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149600818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:11:01,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:11:01,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:11:01 BasicIcfg [2019-12-07 10:11:01,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:11:01,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:11:01,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:11:01,140 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:11:01,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:56" (3/4) ... [2019-12-07 10:11:01,141 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:11:01,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t65~0.base_69| 4) |v_#length_21|) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69|)) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t65~0.offset_41|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t65~0.base_69|) |v_ULTIMATE.start_main_~#t65~0.offset_41| 0)) |v_#memory_int_19|) (= v_~__unbuffered_cnt~0_149 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t65~0.base_69|) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= 0 v_~y$r_buff1_thd3~0_405) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= |v_#valid_104| (store .cse0 |v_ULTIMATE.start_main_~#t65~0.base_69| 1)) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t65~0.offset=|v_ULTIMATE.start_main_~#t65~0.offset_41|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t65~0.base=|v_ULTIMATE.start_main_~#t65~0.base_69|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_70|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ~y~0=v_~y~0_368, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_43|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t65~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t67~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t65~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t66~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t66~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t67~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:11:01,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t66~0.base_12| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t66~0.base_12|) |v_ULTIMATE.start_main_~#t66~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t66~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t66~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t66~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t66~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t66~0.base=|v_ULTIMATE.start_main_~#t66~0.base_12|, ULTIMATE.start_main_~#t66~0.offset=|v_ULTIMATE.start_main_~#t66~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t66~0.base, ULTIMATE.start_main_~#t66~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:11:01,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t67~0.base_11|) |v_ULTIMATE.start_main_~#t67~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t67~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t67~0.base_11| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t67~0.base_11| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t67~0.offset_9| 0) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t67~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t67~0.offset=|v_ULTIMATE.start_main_~#t67~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t67~0.base=|v_ULTIMATE.start_main_~#t67~0.base_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t67~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t67~0.base, #length] because there is no mapped edge [2019-12-07 10:11:01,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:11:01,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In798412424 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In798412424 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out798412424| ~y$w_buff0~0_In798412424)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In798412424 |P2Thread1of1ForFork0_#t~ite28_Out798412424|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In798412424, ~y$w_buff1~0=~y$w_buff1~0_In798412424, ~y$w_buff0~0=~y$w_buff0~0_In798412424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In798412424} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out798412424|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In798412424, ~y$w_buff1~0=~y$w_buff1~0_In798412424, ~y$w_buff0~0=~y$w_buff0~0_In798412424, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In798412424} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:11:01,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:11:01,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:11:01,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-808172338 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-808172338| ~y~0_In-808172338) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-808172338| ~y$mem_tmp~0_In-808172338)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-808172338, ~y$flush_delayed~0=~y$flush_delayed~0_In-808172338, ~y~0=~y~0_In-808172338} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-808172338|, ~y$mem_tmp~0=~y$mem_tmp~0_In-808172338, ~y$flush_delayed~0=~y$flush_delayed~0_In-808172338, ~y~0=~y~0_In-808172338} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:11:01,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:11:01,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-964260600 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-964260600| ~y$mem_tmp~0_In-964260600) (not .cse0)) (and .cse0 (= ~y~0_In-964260600 |P1Thread1of1ForFork2_#t~ite25_Out-964260600|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-964260600, ~y$flush_delayed~0=~y$flush_delayed~0_In-964260600, ~y~0=~y~0_In-964260600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-964260600, ~y$flush_delayed~0=~y$flush_delayed~0_In-964260600, ~y~0=~y~0_In-964260600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-964260600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:11:01,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:11:01,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In888035749 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In888035749 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out888035749|)) (and (= ~y$w_buff0_used~0_In888035749 |P2Thread1of1ForFork0_#t~ite51_Out888035749|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In888035749, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888035749} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In888035749, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888035749, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out888035749|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:11:01,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1080311541 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1080311541 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1080311541 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1080311541 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1080311541| ~y$w_buff1_used~0_In1080311541) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1080311541|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1080311541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1080311541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1080311541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080311541} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1080311541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1080311541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1080311541, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1080311541|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1080311541} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:11:01,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-852958517 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-852958517 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-852958517 ~y$r_buff0_thd3~0_Out-852958517))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-852958517)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-852958517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-852958517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-852958517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-852958517, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-852958517|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:11:01,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-456475820 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-456475820 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-456475820 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-456475820 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-456475820| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-456475820| ~y$r_buff1_thd3~0_In-456475820)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-456475820, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-456475820, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456475820, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-456475820} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-456475820, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-456475820, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-456475820|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-456475820, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-456475820} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:11:01,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:11:01,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:11:01,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1148787481 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1148787481 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out-1148787481| |ULTIMATE.start_main_#t~ite58_Out-1148787481|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1148787481 |ULTIMATE.start_main_#t~ite58_Out-1148787481|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-1148787481| ~y~0_In-1148787481) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1148787481, ~y~0=~y~0_In-1148787481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1148787481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1148787481} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1148787481, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1148787481|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1148787481|, ~y~0=~y~0_In-1148787481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1148787481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1148787481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:11:01,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2032140504 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2032140504 256) 0))) (or (and (= ~y$w_buff0_used~0_In2032140504 |ULTIMATE.start_main_#t~ite60_Out2032140504|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out2032140504| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2032140504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032140504} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2032140504|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2032140504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032140504} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:11:01,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1014953686 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1014953686 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1014953686 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1014953686 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1014953686|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1014953686| ~y$w_buff1_used~0_In1014953686) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1014953686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1014953686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1014953686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014953686} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1014953686|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1014953686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1014953686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1014953686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1014953686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:11:01,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In512579161 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In512579161 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out512579161|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In512579161 |ULTIMATE.start_main_#t~ite62_Out512579161|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512579161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512579161} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out512579161|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In512579161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512579161} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:11:01,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-149600818 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-149600818 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-149600818 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-149600818 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-149600818| ~y$r_buff1_thd0~0_In-149600818) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite63_Out-149600818| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-149600818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149600818, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149600818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149600818} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-149600818|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-149600818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149600818, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149600818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149600818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:11:01,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:11:01,223 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dbbb0a79-bc45-44ee-9f63-cb4a390cc642/bin/uautomizer/witness.graphml [2019-12-07 10:11:01,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:11:01,224 INFO L168 Benchmark]: Toolchain (without parser) took 125871.22 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 939.1 MB in the beginning and 6.4 GB in the end (delta: -5.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,225 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:11:01,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,225 INFO L168 Benchmark]: Boogie Preprocessor took 26.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,226 INFO L168 Benchmark]: RCFGBuilder took 461.87 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.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,226 INFO L168 Benchmark]: TraceAbstraction took 124816.83 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,226 INFO L168 Benchmark]: Witness Printer took 83.94 ms. Allocated memory is still 8.1 GB. Free memory was 6.4 GB in the beginning and 6.4 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:11:01,228 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 437.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 461.87 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.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 124816.83 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 83.94 ms. Allocated memory is still 8.1 GB. Free memory was 6.4 GB in the beginning and 6.4 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7734 SDtfs, 11251 SDslu, 23120 SDs, 0 SdLazy, 12095 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204246occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 76.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 809450 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1097 NumberOfCodeBlocks, 1097 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 323256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...