./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_rmo.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_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/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 586905fd6d18b653e017f1f614979fdf0ba4a3cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:49:55,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:49:55,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:49:55,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:49:55,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:49:55,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:49:55,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:49:55,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:49:55,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:49:55,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:49:55,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:49:55,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:49:55,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:49:55,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:49:55,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:49:55,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:49:55,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:49:55,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:49:55,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:49:55,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:49:55,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:49:55,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:49:55,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:49:55,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:49:55,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:49:55,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:49:55,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:49:55,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:49:55,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:49:55,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:49:55,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:49:55,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:49:55,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:49:55,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:49:55,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:49:55,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:49:55,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:49:55,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:49:55,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:49:55,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:49:55,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:49:55,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:49:56,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:49:56,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:49:56,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:49:56,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:49:56,002 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:49:56,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:49:56,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:49:56,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:49:56,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:49:56,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:49:56,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:49:56,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:49:56,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:49:56,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:49:56,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:49:56,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:49:56,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:49:56,005 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_026451e0-c7b2-4d40-a519-896b04466126/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 -> 586905fd6d18b653e017f1f614979fdf0ba4a3cb [2019-12-07 12:49:56,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:49:56,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:49:56,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:49:56,124 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:49:56,124 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:49:56,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-12-07 12:49:56,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/data/302f2c8da/77f9bb23ca9440b698066008d93d6f98/FLAG6a4d2ba17 [2019-12-07 12:49:56,651 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:49:56,652 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-12-07 12:49:56,663 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/data/302f2c8da/77f9bb23ca9440b698066008d93d6f98/FLAG6a4d2ba17 [2019-12-07 12:49:56,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/data/302f2c8da/77f9bb23ca9440b698066008d93d6f98 [2019-12-07 12:49:56,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:49:56,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:49:56,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:49:56,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:49:56,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:49:56,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:49:56" (1/1) ... [2019-12-07 12:49:56,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490253ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:56, skipping insertion in model container [2019-12-07 12:49:56,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:49:56" (1/1) ... [2019-12-07 12:49:56,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:49:56,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:49:56,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:49:56,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:49:57,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:49:57,053 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:49:57,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57 WrapperNode [2019-12-07 12:49:57,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:49:57,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:49:57,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:49:57,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:49:57,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:49:57,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:49:57,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:49:57,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:49:57,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... [2019-12-07 12:49:57,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:49:57,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:49:57,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:49:57,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:49:57,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:49:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:49:57,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:49:57,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:49:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:49:57,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:49:57,156 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:49:57,490 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:49:57,490 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:49:57,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:49:57 BoogieIcfgContainer [2019-12-07 12:49:57,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:49:57,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:49:57,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:49:57,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:49:57,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:49:56" (1/3) ... [2019-12-07 12:49:57,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c6e0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:49:57, skipping insertion in model container [2019-12-07 12:49:57,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:49:57" (2/3) ... [2019-12-07 12:49:57,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c6e0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:49:57, skipping insertion in model container [2019-12-07 12:49:57,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:49:57" (3/3) ... [2019-12-07 12:49:57,496 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-12-07 12:49:57,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:49:57,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:49:57,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:49:57,507 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:49:57,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:49:57,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:49:57,569 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:49:57,569 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:49:57,569 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:49:57,569 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:49:57,569 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:49:57,569 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:49:57,569 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:49:57,569 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:49:57,579 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-07 12:49:57,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 12:49:57,628 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 12:49:57,628 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:49:57,636 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:49:57,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 12:49:57,680 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 12:49:57,680 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:49:57,685 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:49:57,697 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:49:57,697 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:50:00,424 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:50:00,650 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-07 12:50:00,650 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-07 12:50:00,652 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-07 12:50:01,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-07 12:50:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-07 12:50:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:50:01,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:01,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:50:01,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-07 12:50:01,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:01,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074221884] [2019-12-07 12:50:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:01,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074221884] [2019-12-07 12:50:01,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:50:01,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883579944] [2019-12-07 12:50:01,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:01,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:01,183 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-07 12:50:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:01,353 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-07 12:50:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:01,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:50:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:01,417 INFO L225 Difference]: With dead ends: 8598 [2019-12-07 12:50:01,417 INFO L226 Difference]: Without dead ends: 7662 [2019-12-07 12:50:01,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-07 12:50:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-07 12:50:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-07 12:50:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-07 12:50:01,676 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-07 12:50:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:01,677 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-07 12:50:01,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-07 12:50:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:50:01,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:01,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:01,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-07 12:50:01,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:01,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557573729] [2019-12-07 12:50:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557573729] [2019-12-07 12:50:01,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:01,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:01,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34410597] [2019-12-07 12:50:01,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:01,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:01,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:01,755 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 4 states. [2019-12-07 12:50:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:02,021 INFO L93 Difference]: Finished difference Result 11648 states and 36322 transitions. [2019-12-07 12:50:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:02,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:50:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:02,071 INFO L225 Difference]: With dead ends: 11648 [2019-12-07 12:50:02,072 INFO L226 Difference]: Without dead ends: 11634 [2019-12-07 12:50:02,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-07 12:50:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 10434. [2019-12-07 12:50:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-12-07 12:50:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 33156 transitions. [2019-12-07 12:50:02,316 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 33156 transitions. Word has length 11 [2019-12-07 12:50:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:02,317 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 33156 transitions. [2019-12-07 12:50:02,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 33156 transitions. [2019-12-07 12:50:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:50:02,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:02,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:02,321 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-07 12:50:02,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:02,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144090595] [2019-12-07 12:50:02,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:02,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144090595] [2019-12-07 12:50:02,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:02,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:02,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40380794] [2019-12-07 12:50:02,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:02,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:02,354 INFO L87 Difference]: Start difference. First operand 10434 states and 33156 transitions. Second operand 3 states. [2019-12-07 12:50:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:02,440 INFO L93 Difference]: Finished difference Result 15676 states and 49653 transitions. [2019-12-07 12:50:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:02,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 12:50:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:02,473 INFO L225 Difference]: With dead ends: 15676 [2019-12-07 12:50:02,473 INFO L226 Difference]: Without dead ends: 15676 [2019-12-07 12:50:02,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2019-12-07 12:50:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 11940. [2019-12-07 12:50:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-12-07 12:50:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 38316 transitions. [2019-12-07 12:50:02,775 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 38316 transitions. Word has length 14 [2019-12-07 12:50:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:02,776 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 38316 transitions. [2019-12-07 12:50:02,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 38316 transitions. [2019-12-07 12:50:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:50:02,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:02,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:02,778 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-07 12:50:02,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:02,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163005189] [2019-12-07 12:50:02,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:02,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163005189] [2019-12-07 12:50:02,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:02,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:02,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321370854] [2019-12-07 12:50:02,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:02,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:02,827 INFO L87 Difference]: Start difference. First operand 11940 states and 38316 transitions. Second operand 4 states. [2019-12-07 12:50:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:03,002 INFO L93 Difference]: Finished difference Result 14601 states and 46104 transitions. [2019-12-07 12:50:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:03,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:50:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:03,044 INFO L225 Difference]: With dead ends: 14601 [2019-12-07 12:50:03,044 INFO L226 Difference]: Without dead ends: 14601 [2019-12-07 12:50:03,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2019-12-07 12:50:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 13192. [2019-12-07 12:50:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-12-07 12:50:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 42090 transitions. [2019-12-07 12:50:03,301 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 42090 transitions. Word has length 14 [2019-12-07 12:50:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:03,301 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 42090 transitions. [2019-12-07 12:50:03,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 42090 transitions. [2019-12-07 12:50:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:50:03,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:03,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:03,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-07 12:50:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:03,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761538331] [2019-12-07 12:50:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:03,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761538331] [2019-12-07 12:50:03,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:03,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:03,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390718956] [2019-12-07 12:50:03,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:03,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:03,347 INFO L87 Difference]: Start difference. First operand 13192 states and 42090 transitions. Second operand 4 states. [2019-12-07 12:50:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:03,498 INFO L93 Difference]: Finished difference Result 15525 states and 49066 transitions. [2019-12-07 12:50:03,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:50:03,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:50:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:03,520 INFO L225 Difference]: With dead ends: 15525 [2019-12-07 12:50:03,521 INFO L226 Difference]: Without dead ends: 15525 [2019-12-07 12:50:03,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-12-07 12:50:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13326. [2019-12-07 12:50:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13326 states. [2019-12-07 12:50:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13326 states to 13326 states and 42542 transitions. [2019-12-07 12:50:03,775 INFO L78 Accepts]: Start accepts. Automaton has 13326 states and 42542 transitions. Word has length 14 [2019-12-07 12:50:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:03,775 INFO L462 AbstractCegarLoop]: Abstraction has 13326 states and 42542 transitions. [2019-12-07 12:50:03,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 13326 states and 42542 transitions. [2019-12-07 12:50:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:50:03,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:03,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:03,778 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:03,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1158249311, now seen corresponding path program 1 times [2019-12-07 12:50:03,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:03,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981723320] [2019-12-07 12:50:03,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:03,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981723320] [2019-12-07 12:50:03,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:03,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:50:03,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216769509] [2019-12-07 12:50:03,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:03,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:03,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:03,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:03,827 INFO L87 Difference]: Start difference. First operand 13326 states and 42542 transitions. Second operand 3 states. [2019-12-07 12:50:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:03,882 INFO L93 Difference]: Finished difference Result 13463 states and 42825 transitions. [2019-12-07 12:50:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:03,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:50:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:03,905 INFO L225 Difference]: With dead ends: 13463 [2019-12-07 12:50:03,906 INFO L226 Difference]: Without dead ends: 13463 [2019-12-07 12:50:03,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13463 states. [2019-12-07 12:50:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13463 to 13323. [2019-12-07 12:50:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13323 states. [2019-12-07 12:50:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13323 states to 13323 states and 42533 transitions. [2019-12-07 12:50:04,111 INFO L78 Accepts]: Start accepts. Automaton has 13323 states and 42533 transitions. Word has length 16 [2019-12-07 12:50:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:04,112 INFO L462 AbstractCegarLoop]: Abstraction has 13323 states and 42533 transitions. [2019-12-07 12:50:04,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13323 states and 42533 transitions. [2019-12-07 12:50:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:04,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:04,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:04,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1958502356, now seen corresponding path program 1 times [2019-12-07 12:50:04,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:04,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021985011] [2019-12-07 12:50:04,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:04,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 12:50:04,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021985011] [2019-12-07 12:50:04,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:04,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:50:04,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891781515] [2019-12-07 12:50:04,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:04,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:04,159 INFO L87 Difference]: Start difference. First operand 13323 states and 42533 transitions. Second operand 3 states. [2019-12-07 12:50:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:04,198 INFO L93 Difference]: Finished difference Result 13301 states and 42468 transitions. [2019-12-07 12:50:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:04,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:50:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:04,214 INFO L225 Difference]: With dead ends: 13301 [2019-12-07 12:50:04,215 INFO L226 Difference]: Without dead ends: 13301 [2019-12-07 12:50:04,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13301 states. [2019-12-07 12:50:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13301 to 13301. [2019-12-07 12:50:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13301 states. [2019-12-07 12:50:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13301 states to 13301 states and 42468 transitions. [2019-12-07 12:50:04,468 INFO L78 Accepts]: Start accepts. Automaton has 13301 states and 42468 transitions. Word has length 17 [2019-12-07 12:50:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:04,468 INFO L462 AbstractCegarLoop]: Abstraction has 13301 states and 42468 transitions. [2019-12-07 12:50:04,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 13301 states and 42468 transitions. [2019-12-07 12:50:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:04,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:04,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:04,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:04,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1545984591, now seen corresponding path program 1 times [2019-12-07 12:50:04,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:04,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762322514] [2019-12-07 12:50:04,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:04,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762322514] [2019-12-07 12:50:04,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:04,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:04,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027745239] [2019-12-07 12:50:04,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:04,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:04,507 INFO L87 Difference]: Start difference. First operand 13301 states and 42468 transitions. Second operand 3 states. [2019-12-07 12:50:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:04,549 INFO L93 Difference]: Finished difference Result 12583 states and 39558 transitions. [2019-12-07 12:50:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:04,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:50:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:04,566 INFO L225 Difference]: With dead ends: 12583 [2019-12-07 12:50:04,566 INFO L226 Difference]: Without dead ends: 12583 [2019-12-07 12:50:04,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12583 states. [2019-12-07 12:50:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12583 to 12503. [2019-12-07 12:50:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2019-12-07 12:50:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 39326 transitions. [2019-12-07 12:50:04,749 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 39326 transitions. Word has length 17 [2019-12-07 12:50:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:04,749 INFO L462 AbstractCegarLoop]: Abstraction has 12503 states and 39326 transitions. [2019-12-07 12:50:04,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 39326 transitions. [2019-12-07 12:50:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:50:04,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:04,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:04,752 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 819852344, now seen corresponding path program 1 times [2019-12-07 12:50:04,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:04,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137545774] [2019-12-07 12:50:04,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:04,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137545774] [2019-12-07 12:50:04,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:04,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:04,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640473942] [2019-12-07 12:50:04,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:04,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:04,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:04,789 INFO L87 Difference]: Start difference. First operand 12503 states and 39326 transitions. Second operand 3 states. [2019-12-07 12:50:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:04,800 INFO L93 Difference]: Finished difference Result 1631 states and 3669 transitions. [2019-12-07 12:50:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:04,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:50:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:04,802 INFO L225 Difference]: With dead ends: 1631 [2019-12-07 12:50:04,802 INFO L226 Difference]: Without dead ends: 1631 [2019-12-07 12:50:04,802 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 12:50:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-07 12:50:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2019-12-07 12:50:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2019-12-07 12:50:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3669 transitions. [2019-12-07 12:50:04,821 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3669 transitions. Word has length 17 [2019-12-07 12:50:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:04,821 INFO L462 AbstractCegarLoop]: Abstraction has 1631 states and 3669 transitions. [2019-12-07 12:50:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3669 transitions. [2019-12-07 12:50:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:50:04,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:04,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:04,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-07 12:50:04,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:04,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91849548] [2019-12-07 12:50:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:04,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91849548] [2019-12-07 12:50:04,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:04,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:04,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223852178] [2019-12-07 12:50:04,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:04,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:04,889 INFO L87 Difference]: Start difference. First operand 1631 states and 3669 transitions. Second operand 5 states. [2019-12-07 12:50:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:05,026 INFO L93 Difference]: Finished difference Result 2140 states and 4682 transitions. [2019-12-07 12:50:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:05,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 12:50:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:05,028 INFO L225 Difference]: With dead ends: 2140 [2019-12-07 12:50:05,028 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 12:50:05,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 12:50:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1699. [2019-12-07 12:50:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 12:50:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3809 transitions. [2019-12-07 12:50:05,044 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3809 transitions. Word has length 24 [2019-12-07 12:50:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:05,044 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 3809 transitions. [2019-12-07 12:50:05,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3809 transitions. [2019-12-07 12:50:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:50:05,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:05,046 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:05,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-07 12:50:05,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:05,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20602737] [2019-12-07 12:50:05,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:05,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20602737] [2019-12-07 12:50:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312462838] [2019-12-07 12:50:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:50:05,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:50:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:50:05,110 INFO L87 Difference]: Start difference. First operand 1699 states and 3809 transitions. Second operand 5 states. [2019-12-07 12:50:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:05,256 INFO L93 Difference]: Finished difference Result 2154 states and 4711 transitions. [2019-12-07 12:50:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:50:05,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:50:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:05,258 INFO L225 Difference]: With dead ends: 2154 [2019-12-07 12:50:05,258 INFO L226 Difference]: Without dead ends: 2154 [2019-12-07 12:50:05,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-12-07 12:50:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1645. [2019-12-07 12:50:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-12-07 12:50:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3698 transitions. [2019-12-07 12:50:05,273 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3698 transitions. Word has length 26 [2019-12-07 12:50:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:05,273 INFO L462 AbstractCegarLoop]: Abstraction has 1645 states and 3698 transitions. [2019-12-07 12:50:05,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:50:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3698 transitions. [2019-12-07 12:50:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:50:05,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:05,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:05,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-07 12:50:05,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:05,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198707040] [2019-12-07 12:50:05,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:05,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198707040] [2019-12-07 12:50:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:50:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558148191] [2019-12-07 12:50:05,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:50:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:50:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:50:05,314 INFO L87 Difference]: Start difference. First operand 1645 states and 3698 transitions. Second operand 4 states. [2019-12-07 12:50:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:05,324 INFO L93 Difference]: Finished difference Result 797 states and 1775 transitions. [2019-12-07 12:50:05,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:50:05,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 12:50:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:05,325 INFO L225 Difference]: With dead ends: 797 [2019-12-07 12:50:05,325 INFO L226 Difference]: Without dead ends: 797 [2019-12-07 12:50:05,325 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 12:50:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-07 12:50:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-07 12:50:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 12:50:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1775 transitions. [2019-12-07 12:50:05,332 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1775 transitions. Word has length 28 [2019-12-07 12:50:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:05,332 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1775 transitions. [2019-12-07 12:50:05,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:50:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1775 transitions. [2019-12-07 12:50:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:50:05,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:05,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:05,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-12-07 12:50:05,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:05,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692481236] [2019-12-07 12:50:05,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692481236] [2019-12-07 12:50:05,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:05,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303603496] [2019-12-07 12:50:05,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:50:05,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:50:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:50:05,400 INFO L87 Difference]: Start difference. First operand 797 states and 1775 transitions. Second operand 6 states. [2019-12-07 12:50:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:05,774 INFO L93 Difference]: Finished difference Result 1393 states and 2999 transitions. [2019-12-07 12:50:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:50:05,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 12:50:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:05,776 INFO L225 Difference]: With dead ends: 1393 [2019-12-07 12:50:05,776 INFO L226 Difference]: Without dead ends: 1393 [2019-12-07 12:50:05,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:50:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-12-07 12:50:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1070. [2019-12-07 12:50:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-12-07 12:50:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2374 transitions. [2019-12-07 12:50:05,786 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 2374 transitions. Word has length 51 [2019-12-07 12:50:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 2374 transitions. [2019-12-07 12:50:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:50:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 2374 transitions. [2019-12-07 12:50:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:50:05,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:05,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:05,788 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2123622504, now seen corresponding path program 2 times [2019-12-07 12:50:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012889856] [2019-12-07 12:50:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:05,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012889856] [2019-12-07 12:50:05,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:05,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:50:05,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161702249] [2019-12-07 12:50:05,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:50:05,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:05,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:50:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:05,828 INFO L87 Difference]: Start difference. First operand 1070 states and 2374 transitions. Second operand 3 states. [2019-12-07 12:50:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:05,858 INFO L93 Difference]: Finished difference Result 1308 states and 2876 transitions. [2019-12-07 12:50:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:50:05,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 12:50:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:05,860 INFO L225 Difference]: With dead ends: 1308 [2019-12-07 12:50:05,860 INFO L226 Difference]: Without dead ends: 1308 [2019-12-07 12:50:05,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:50:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-12-07 12:50:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1082. [2019-12-07 12:50:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-12-07 12:50:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2405 transitions. [2019-12-07 12:50:05,869 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2405 transitions. Word has length 51 [2019-12-07 12:50:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:05,869 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 2405 transitions. [2019-12-07 12:50:05,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:50:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2405 transitions. [2019-12-07 12:50:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:50:05,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:05,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:05,871 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-12-07 12:50:05,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001722561] [2019-12-07 12:50:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:50:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:50:05,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001722561] [2019-12-07 12:50:05,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:50:05,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:50:05,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092480988] [2019-12-07 12:50:05,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:50:05,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:50:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:50:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:50:05,932 INFO L87 Difference]: Start difference. First operand 1082 states and 2405 transitions. Second operand 7 states. [2019-12-07 12:50:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:50:06,108 INFO L93 Difference]: Finished difference Result 2908 states and 6314 transitions. [2019-12-07 12:50:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:50:06,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:50:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:50:06,109 INFO L225 Difference]: With dead ends: 2908 [2019-12-07 12:50:06,110 INFO L226 Difference]: Without dead ends: 1983 [2019-12-07 12:50:06,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:50:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-12-07 12:50:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1139. [2019-12-07 12:50:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 12:50:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2528 transitions. [2019-12-07 12:50:06,121 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2528 transitions. Word has length 52 [2019-12-07 12:50:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:50:06,122 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2528 transitions. [2019-12-07 12:50:06,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:50:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2528 transitions. [2019-12-07 12:50:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:50:06,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:50:06,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:50:06,123 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:50:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:50:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-12-07 12:50:06,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:50:06,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56804705] [2019-12-07 12:50:06,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:50:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:50:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:50:06,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:50:06,194 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:50:06,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 12:50:06,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:50:06,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out257953556 ~z$w_buff0_used~0_In257953556) (= ~z$w_buff0~0_Out257953556 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In257953556| P0Thread1of1ForFork0_~arg.offset_Out257953556) (= ~z$w_buff1~0_Out257953556 ~z$w_buff0~0_In257953556) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556) (= P0Thread1of1ForFork0_~arg.base_Out257953556 |P0Thread1of1ForFork0_#in~arg.base_In257953556|) (= 1 ~z$w_buff0_used~0_Out257953556) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556)) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out257953556 256))) (not (= 0 (mod ~z$w_buff1_used~0_Out257953556 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In257953556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In257953556, ~z$w_buff0~0=~z$w_buff0~0_In257953556, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In257953556|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In257953556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out257953556, ~z$w_buff0~0=~z$w_buff0~0_Out257953556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out257953556, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In257953556|, ~z$w_buff1~0=~z$w_buff1~0_Out257953556, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out257953556, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out257953556} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:50:06,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1784786649 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1784786649| ~z$w_buff1_used~0_In1784786649) (= |P1Thread1of1ForFork1_#t~ite23_In1784786649| |P1Thread1of1ForFork1_#t~ite23_Out1784786649|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1784786649| |P1Thread1of1ForFork1_#t~ite24_Out1784786649|) (= |P1Thread1of1ForFork1_#t~ite23_Out1784786649| ~z$w_buff1_used~0_In1784786649) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1784786649 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1784786649 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In1784786649 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1784786649 256)))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1784786649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1784786649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784786649, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1784786649|, ~weak$$choice2~0=~weak$$choice2~0_In1784786649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1784786649} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1784786649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1784786649, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1784786649|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784786649, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1784786649|, ~weak$$choice2~0=~weak$$choice2~0_In1784786649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1784786649} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 12:50:06,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:50:06,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 12:50:06,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1830510933 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1830510933 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1830510933| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1830510933| ~z$w_buff0_used~0_In-1830510933) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1830510933, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1830510933} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1830510933|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1830510933, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1830510933} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:50:06,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1829151267 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1829151267 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1829151267 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1829151267 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1829151267| ~z$w_buff1_used~0_In-1829151267) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1829151267| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829151267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829151267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829151267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829151267} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1829151267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829151267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829151267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829151267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829151267} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:50:06,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_Out-507370732 ~z$r_buff0_thd1~0_In-507370732)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-507370732 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-507370732 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out-507370732 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-507370732, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-507370732} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-507370732, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-507370732|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-507370732} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:50:06,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1774708143 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1774708143 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1774708143 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1774708143 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1774708143| ~z$r_buff1_thd1~0_In-1774708143)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1774708143|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774708143, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1774708143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774708143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1774708143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774708143, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1774708143|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1774708143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774708143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1774708143} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:50:06,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In522472725 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out522472725| |P1Thread1of1ForFork1_#t~ite32_Out522472725|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In522472725 256)))) (or (and (= ~z~0_In522472725 |P1Thread1of1ForFork1_#t~ite32_Out522472725|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In522472725 |P1Thread1of1ForFork1_#t~ite32_Out522472725|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In522472725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522472725, ~z$w_buff1~0=~z$w_buff1~0_In522472725, ~z~0=~z~0_In522472725} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In522472725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522472725, ~z$w_buff1~0=~z$w_buff1~0_In522472725, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out522472725|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out522472725|, ~z~0=~z~0_In522472725} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:50:06,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2028366042 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2028366042 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2028366042|) (not .cse1)) (and (= ~z$w_buff0_used~0_In2028366042 |P1Thread1of1ForFork1_#t~ite34_Out2028366042|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2028366042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2028366042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2028366042, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2028366042|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2028366042} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:50:06,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1258632916 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1258632916 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1258632916 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1258632916 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1258632916| ~z$w_buff1_used~0_In1258632916) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1258632916|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1258632916, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1258632916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1258632916, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1258632916} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1258632916, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1258632916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1258632916, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1258632916|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1258632916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:50:06,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1559415490 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1559415490 256)))) (or (and (= ~z$r_buff0_thd2~0_In1559415490 |P1Thread1of1ForFork1_#t~ite36_Out1559415490|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1559415490|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1559415490, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1559415490} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1559415490, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1559415490, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1559415490|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:50:06,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1936005987 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1936005987 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1936005987 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1936005987 256)))) (or (and (= ~z$r_buff1_thd2~0_In-1936005987 |P1Thread1of1ForFork1_#t~ite37_Out-1936005987|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1936005987| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936005987, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1936005987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936005987, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1936005987} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936005987, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1936005987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936005987, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1936005987, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1936005987|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:06,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1498943122 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1498943122 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1498943122| ~z~0_In-1498943122) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1498943122| ~z$w_buff1~0_In-1498943122) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498943122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498943122, ~z$w_buff1~0=~z$w_buff1~0_In-1498943122, ~z~0=~z~0_In-1498943122} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1498943122|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498943122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498943122, ~z$w_buff1~0=~z$w_buff1~0_In-1498943122, ~z~0=~z~0_In-1498943122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-858190043 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-858190043 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-858190043| 0)) (and (= ~z$w_buff0_used~0_In-858190043 |ULTIMATE.start_main_#t~ite42_Out-858190043|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-858190043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-858190043} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-858190043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-858190043, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-858190043|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:50:06,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-594564680 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-594564680 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-594564680 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-594564680 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-594564680|)) (and (= ~z$w_buff1_used~0_In-594564680 |ULTIMATE.start_main_#t~ite43_Out-594564680|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594564680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594564680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-594564680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594564680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594564680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594564680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-594564680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594564680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-594564680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:50:06,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1724937382 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1724937382 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1724937382| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1724937382 |ULTIMATE.start_main_#t~ite44_Out1724937382|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1724937382, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1724937382} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1724937382, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1724937382, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1724937382|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:50:06,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1960262544 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1960262544 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1960262544 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1960262544 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1960262544| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-1960262544| ~z$r_buff1_thd0~0_In-1960262544) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960262544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960262544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960262544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960262544} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960262544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960262544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960262544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960262544, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1960262544|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:50:06,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:50:06,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:50:06 BasicIcfg [2019-12-07 12:50:06,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:50:06,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:50:06,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:50:06,244 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:50:06,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:49:57" (3/4) ... [2019-12-07 12:50:06,246 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:50:06,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 12:50:06,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:50:06,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out257953556 ~z$w_buff0_used~0_In257953556) (= ~z$w_buff0~0_Out257953556 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In257953556| P0Thread1of1ForFork0_~arg.offset_Out257953556) (= ~z$w_buff1~0_Out257953556 ~z$w_buff0~0_In257953556) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556) (= P0Thread1of1ForFork0_~arg.base_Out257953556 |P0Thread1of1ForFork0_#in~arg.base_In257953556|) (= 1 ~z$w_buff0_used~0_Out257953556) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556)) (= (ite (not (and (not (= 0 (mod ~z$w_buff0_used~0_Out257953556 256))) (not (= 0 (mod ~z$w_buff1_used~0_Out257953556 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In257953556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In257953556, ~z$w_buff0~0=~z$w_buff0~0_In257953556, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In257953556|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In257953556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out257953556, ~z$w_buff0~0=~z$w_buff0~0_Out257953556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out257953556, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out257953556, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In257953556|, ~z$w_buff1~0=~z$w_buff1~0_Out257953556, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out257953556, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out257953556|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out257953556} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:50:06,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1784786649 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1784786649| ~z$w_buff1_used~0_In1784786649) (= |P1Thread1of1ForFork1_#t~ite23_In1784786649| |P1Thread1of1ForFork1_#t~ite23_Out1784786649|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1784786649| |P1Thread1of1ForFork1_#t~ite24_Out1784786649|) (= |P1Thread1of1ForFork1_#t~ite23_Out1784786649| ~z$w_buff1_used~0_In1784786649) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1784786649 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1784786649 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In1784786649 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1784786649 256)))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1784786649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1784786649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784786649, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1784786649|, ~weak$$choice2~0=~weak$$choice2~0_In1784786649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1784786649} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1784786649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1784786649, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1784786649|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784786649, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1784786649|, ~weak$$choice2~0=~weak$$choice2~0_In1784786649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1784786649} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 12:50:06,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:50:06,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 12:50:06,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1830510933 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1830510933 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1830510933| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1830510933| ~z$w_buff0_used~0_In-1830510933) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1830510933, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1830510933} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1830510933|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1830510933, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1830510933} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:50:06,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1829151267 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1829151267 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1829151267 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1829151267 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1829151267| ~z$w_buff1_used~0_In-1829151267) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1829151267| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829151267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829151267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829151267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829151267} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1829151267|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829151267, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829151267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829151267, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829151267} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:50:06,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_Out-507370732 ~z$r_buff0_thd1~0_In-507370732)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-507370732 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-507370732 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out-507370732 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-507370732, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-507370732} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-507370732, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-507370732|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-507370732} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:50:06,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1774708143 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1774708143 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1774708143 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1774708143 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1774708143| ~z$r_buff1_thd1~0_In-1774708143)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1774708143|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774708143, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1774708143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774708143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1774708143} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1774708143, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1774708143|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1774708143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1774708143, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1774708143} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:50:06,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In522472725 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out522472725| |P1Thread1of1ForFork1_#t~ite32_Out522472725|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In522472725 256)))) (or (and (= ~z~0_In522472725 |P1Thread1of1ForFork1_#t~ite32_Out522472725|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In522472725 |P1Thread1of1ForFork1_#t~ite32_Out522472725|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In522472725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522472725, ~z$w_buff1~0=~z$w_buff1~0_In522472725, ~z~0=~z~0_In522472725} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In522472725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In522472725, ~z$w_buff1~0=~z$w_buff1~0_In522472725, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out522472725|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out522472725|, ~z~0=~z~0_In522472725} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 12:50:06,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2028366042 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In2028366042 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2028366042|) (not .cse1)) (and (= ~z$w_buff0_used~0_In2028366042 |P1Thread1of1ForFork1_#t~ite34_Out2028366042|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2028366042, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2028366042} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2028366042, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2028366042|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2028366042} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:50:06,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1258632916 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1258632916 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1258632916 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1258632916 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1258632916| ~z$w_buff1_used~0_In1258632916) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1258632916|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1258632916, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1258632916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1258632916, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1258632916} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1258632916, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1258632916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1258632916, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1258632916|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1258632916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:50:06,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1559415490 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1559415490 256)))) (or (and (= ~z$r_buff0_thd2~0_In1559415490 |P1Thread1of1ForFork1_#t~ite36_Out1559415490|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1559415490|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1559415490, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1559415490} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1559415490, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1559415490, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1559415490|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1936005987 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1936005987 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1936005987 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1936005987 256)))) (or (and (= ~z$r_buff1_thd2~0_In-1936005987 |P1Thread1of1ForFork1_#t~ite37_Out-1936005987|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1936005987| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936005987, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1936005987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936005987, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1936005987} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936005987, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1936005987, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936005987, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1936005987, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1936005987|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1498943122 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1498943122 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1498943122| ~z~0_In-1498943122) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1498943122| ~z$w_buff1~0_In-1498943122) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498943122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498943122, ~z$w_buff1~0=~z$w_buff1~0_In-1498943122, ~z~0=~z~0_In-1498943122} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1498943122|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498943122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498943122, ~z$w_buff1~0=~z$w_buff1~0_In-1498943122, ~z~0=~z~0_In-1498943122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 12:50:06,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-858190043 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-858190043 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-858190043| 0)) (and (= ~z$w_buff0_used~0_In-858190043 |ULTIMATE.start_main_#t~ite42_Out-858190043|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-858190043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-858190043} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-858190043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-858190043, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-858190043|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:50:06,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-594564680 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-594564680 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-594564680 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-594564680 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-594564680|)) (and (= ~z$w_buff1_used~0_In-594564680 |ULTIMATE.start_main_#t~ite43_Out-594564680|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594564680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594564680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-594564680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594564680} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594564680, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594564680, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-594564680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594564680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-594564680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:50:06,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1724937382 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1724937382 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1724937382| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1724937382 |ULTIMATE.start_main_#t~ite44_Out1724937382|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1724937382, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1724937382} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1724937382, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1724937382, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1724937382|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:50:06,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1960262544 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1960262544 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1960262544 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1960262544 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1960262544| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-1960262544| ~z$r_buff1_thd0~0_In-1960262544) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960262544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960262544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960262544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960262544} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1960262544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1960262544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960262544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960262544, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1960262544|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:50:06,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:50:06,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_026451e0-c7b2-4d40-a519-896b04466126/bin/uautomizer/witness.graphml [2019-12-07 12:50:06,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:50:06,303 INFO L168 Benchmark]: Toolchain (without parser) took 9628.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 549.5 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -304.8 MB). Peak memory consumption was 244.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,303 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:50:06,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,304 INFO L168 Benchmark]: Boogie Preprocessor took 24.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,304 INFO L168 Benchmark]: RCFGBuilder took 375.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,304 INFO L168 Benchmark]: TraceAbstraction took 8752.13 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 401.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -203.2 MB). Peak memory consumption was 197.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,305 INFO L168 Benchmark]: Witness Printer took 57.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:50:06,306 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8752.13 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 401.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -203.2 MB). Peak memory consumption was 197.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1869 SDtfs, 1350 SDslu, 3233 SDs, 0 SdLazy, 1540 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13326occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 11107 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 36512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...