./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/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 9cbe5d5e4b1ca845148e08aa16ab839dac62635b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:41:18,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:41:18,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:41:18,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:41:18,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:41:18,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:41:18,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:41:18,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:41:18,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:41:18,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:41:18,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:41:18,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:41:18,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:41:18,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:41:18,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:41:18,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:41:18,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:41:18,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:41:18,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:41:18,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:41:18,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:41:18,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:41:18,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:41:18,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:41:18,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:41:18,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:41:18,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:41:18,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:41:18,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:41:18,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:41:18,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:41:18,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:41:18,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:41:18,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:41:18,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:41:18,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:41:18,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:41:18,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:41:18,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:41:18,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:41:18,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:41:18,959 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:41:18,968 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:41:18,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:41:18,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:41:18,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:41:18,969 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:41:18,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:41:18,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:41:18,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:41:18,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:41:18,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:41:18,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:41:18,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:41:18,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:41:18,972 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_feadb19a-7013-49d3-822a-f6a671c7f712/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 -> 9cbe5d5e4b1ca845148e08aa16ab839dac62635b [2019-12-07 10:41:19,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:41:19,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:41:19,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:41:19,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:41:19,087 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:41:19,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_power.opt.i [2019-12-07 10:41:19,131 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/data/ac0cc4982/214530896b774b8fa32949391c42eed3/FLAGe07c1ca2a [2019-12-07 10:41:19,566 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:41:19,567 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/sv-benchmarks/c/pthread-wmm/mix032_power.opt.i [2019-12-07 10:41:19,577 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/data/ac0cc4982/214530896b774b8fa32949391c42eed3/FLAGe07c1ca2a [2019-12-07 10:41:19,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/data/ac0cc4982/214530896b774b8fa32949391c42eed3 [2019-12-07 10:41:19,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:41:19,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:41:19,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:41:19,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:41:19,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:41:19,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:41:19" (1/1) ... [2019-12-07 10:41:19,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:19, skipping insertion in model container [2019-12-07 10:41:19,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:41:19" (1/1) ... [2019-12-07 10:41:19,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:41:19,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:41:20,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:41:20,192 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:41:20,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:41:20,277 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:41:20,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20 WrapperNode [2019-12-07 10:41:20,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:41:20,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:41:20,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:41:20,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:41:20,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:41:20,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:41:20,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:41:20,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:41:20,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... [2019-12-07 10:41:20,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:41:20,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:41:20,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:41:20,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:41:20,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:41:20,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:41:20,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:41:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:41:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:41:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:41:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:41:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:41:20,379 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:41:20,701 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:41:20,701 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:41:20,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:41:20 BoogieIcfgContainer [2019-12-07 10:41:20,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:41:20,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:41:20,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:41:20,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:41:20,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:41:19" (1/3) ... [2019-12-07 10:41:20,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:41:20, skipping insertion in model container [2019-12-07 10:41:20,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:41:20" (2/3) ... [2019-12-07 10:41:20,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:41:20, skipping insertion in model container [2019-12-07 10:41:20,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:41:20" (3/3) ... [2019-12-07 10:41:20,707 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-12-07 10:41:20,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:41:20,713 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:41:20,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:41:20,718 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:41:20,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:41:20,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:41:20,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:41:20,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:41:20,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:41:20,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:41:20,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:41:20,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:41:20,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:41:20,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:41:20,794 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-07 10:41:20,795 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 10:41:20,855 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 10:41:20,855 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:41:20,865 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 10:41:20,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 10:41:20,911 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 10:41:20,911 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:41:20,915 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 10:41:20,926 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 10:41:20,926 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:41:23,208 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 10:41:23,608 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 10:41:23,699 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-12-07 10:41:23,699 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 10:41:23,702 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 10:41:24,299 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-07 10:41:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-07 10:41:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:41:24,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:24,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:24,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-12-07 10:41:24,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:24,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113330006] [2019-12-07 10:41:24,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:24,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113330006] [2019-12-07 10:41:24,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:24,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:41:24,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658676214] [2019-12-07 10:41:24,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:24,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:24,481 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-07 10:41:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:24,681 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-07 10:41:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:24,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:41:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:24,787 INFO L225 Difference]: With dead ends: 14182 [2019-12-07 10:41:24,787 INFO L226 Difference]: Without dead ends: 13350 [2019-12-07 10:41:24,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-07 10:41:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-07 10:41:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-07 10:41:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-07 10:41:25,292 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-07 10:41:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:25,293 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-07 10:41:25,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-07 10:41:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:41:25,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:25,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:25,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-12-07 10:41:25,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:25,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170280769] [2019-12-07 10:41:25,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:25,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170280769] [2019-12-07 10:41:25,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:25,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:25,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762537820] [2019-12-07 10:41:25,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:25,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:25,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:25,364 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 4 states. [2019-12-07 10:41:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:25,690 INFO L93 Difference]: Finished difference Result 20194 states and 75632 transitions. [2019-12-07 10:41:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:41:25,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:41:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:25,791 INFO L225 Difference]: With dead ends: 20194 [2019-12-07 10:41:25,791 INFO L226 Difference]: Without dead ends: 20164 [2019-12-07 10:41:25,792 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 10:41:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-12-07 10:41:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18344. [2019-12-07 10:41:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-12-07 10:41:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 69695 transitions. [2019-12-07 10:41:26,249 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 69695 transitions. Word has length 13 [2019-12-07 10:41:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:26,249 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 69695 transitions. [2019-12-07 10:41:26,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 69695 transitions. [2019-12-07 10:41:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:41:26,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:26,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:26,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-12-07 10:41:26,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:26,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608801999] [2019-12-07 10:41:26,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608801999] [2019-12-07 10:41:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:26,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:26,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368840333] [2019-12-07 10:41:26,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:26,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:26,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:26,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:26,291 INFO L87 Difference]: Start difference. First operand 18344 states and 69695 transitions. Second operand 3 states. [2019-12-07 10:41:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:26,398 INFO L93 Difference]: Finished difference Result 23466 states and 87296 transitions. [2019-12-07 10:41:26,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:26,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:41:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:26,445 INFO L225 Difference]: With dead ends: 23466 [2019-12-07 10:41:26,445 INFO L226 Difference]: Without dead ends: 23466 [2019-12-07 10:41:26,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23466 states. [2019-12-07 10:41:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 20060. [2019-12-07 10:41:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20060 states. [2019-12-07 10:41:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 75793 transitions. [2019-12-07 10:41:26,891 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 75793 transitions. Word has length 16 [2019-12-07 10:41:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:26,891 INFO L462 AbstractCegarLoop]: Abstraction has 20060 states and 75793 transitions. [2019-12-07 10:41:26,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 75793 transitions. [2019-12-07 10:41:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:41:26,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:26,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:26,895 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-12-07 10:41:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:26,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741060951] [2019-12-07 10:41:26,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:26,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741060951] [2019-12-07 10:41:26,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:26,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:26,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273326814] [2019-12-07 10:41:26,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:26,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:26,936 INFO L87 Difference]: Start difference. First operand 20060 states and 75793 transitions. Second operand 4 states. [2019-12-07 10:41:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:27,114 INFO L93 Difference]: Finished difference Result 24056 states and 89213 transitions. [2019-12-07 10:41:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:41:27,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:41:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:27,160 INFO L225 Difference]: With dead ends: 24056 [2019-12-07 10:41:27,161 INFO L226 Difference]: Without dead ends: 24036 [2019-12-07 10:41:27,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2019-12-07 10:41:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21018. [2019-12-07 10:41:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21018 states. [2019-12-07 10:41:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 79114 transitions. [2019-12-07 10:41:27,653 INFO L78 Accepts]: Start accepts. Automaton has 21018 states and 79114 transitions. Word has length 16 [2019-12-07 10:41:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:27,653 INFO L462 AbstractCegarLoop]: Abstraction has 21018 states and 79114 transitions. [2019-12-07 10:41:27,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 21018 states and 79114 transitions. [2019-12-07 10:41:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:41:27,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:27,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:27,657 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-12-07 10:41:27,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:27,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505568156] [2019-12-07 10:41:27,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:27,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505568156] [2019-12-07 10:41:27,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:27,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:27,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240912485] [2019-12-07 10:41:27,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:27,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:27,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:27,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:27,707 INFO L87 Difference]: Start difference. First operand 21018 states and 79114 transitions. Second operand 4 states. [2019-12-07 10:41:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:27,890 INFO L93 Difference]: Finished difference Result 26444 states and 98339 transitions. [2019-12-07 10:41:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:41:27,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:41:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:27,944 INFO L225 Difference]: With dead ends: 26444 [2019-12-07 10:41:27,944 INFO L226 Difference]: Without dead ends: 26414 [2019-12-07 10:41:27,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26414 states. [2019-12-07 10:41:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26414 to 21928. [2019-12-07 10:41:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21928 states. [2019-12-07 10:41:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 82711 transitions. [2019-12-07 10:41:28,473 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 82711 transitions. Word has length 16 [2019-12-07 10:41:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:28,474 INFO L462 AbstractCegarLoop]: Abstraction has 21928 states and 82711 transitions. [2019-12-07 10:41:28,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 82711 transitions. [2019-12-07 10:41:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:41:28,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:28,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:28,479 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:28,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2076093569, now seen corresponding path program 1 times [2019-12-07 10:41:28,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669815634] [2019-12-07 10:41:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:28,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669815634] [2019-12-07 10:41:28,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:28,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:28,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516098538] [2019-12-07 10:41:28,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:28,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:28,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:28,536 INFO L87 Difference]: Start difference. First operand 21928 states and 82711 transitions. Second operand 3 states. [2019-12-07 10:41:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:28,633 INFO L93 Difference]: Finished difference Result 20766 states and 77222 transitions. [2019-12-07 10:41:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:28,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:41:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:28,668 INFO L225 Difference]: With dead ends: 20766 [2019-12-07 10:41:28,668 INFO L226 Difference]: Without dead ends: 20766 [2019-12-07 10:41:28,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-12-07 10:41:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20282. [2019-12-07 10:41:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-12-07 10:41:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 75572 transitions. [2019-12-07 10:41:29,033 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 75572 transitions. Word has length 18 [2019-12-07 10:41:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:29,033 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 75572 transitions. [2019-12-07 10:41:29,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 75572 transitions. [2019-12-07 10:41:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:41:29,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:29,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:29,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1546230613, now seen corresponding path program 1 times [2019-12-07 10:41:29,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:29,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311951908] [2019-12-07 10:41:29,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:29,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311951908] [2019-12-07 10:41:29,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:29,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:41:29,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85834166] [2019-12-07 10:41:29,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:29,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:29,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:29,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:29,086 INFO L87 Difference]: Start difference. First operand 20282 states and 75572 transitions. Second operand 3 states. [2019-12-07 10:41:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:29,168 INFO L93 Difference]: Finished difference Result 20378 states and 75774 transitions. [2019-12-07 10:41:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:29,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:41:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:29,205 INFO L225 Difference]: With dead ends: 20378 [2019-12-07 10:41:29,205 INFO L226 Difference]: Without dead ends: 20378 [2019-12-07 10:41:29,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20378 states. [2019-12-07 10:41:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20378 to 20279. [2019-12-07 10:41:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-12-07 10:41:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 75560 transitions. [2019-12-07 10:41:29,639 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 75560 transitions. Word has length 18 [2019-12-07 10:41:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:29,639 INFO L462 AbstractCegarLoop]: Abstraction has 20279 states and 75560 transitions. [2019-12-07 10:41:29,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 75560 transitions. [2019-12-07 10:41:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:41:29,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:29,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:29,643 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:29,644 INFO L82 PathProgramCache]: Analyzing trace with hash 876364753, now seen corresponding path program 1 times [2019-12-07 10:41:29,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:29,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413256857] [2019-12-07 10:41:29,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:29,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413256857] [2019-12-07 10:41:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:29,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:29,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912605734] [2019-12-07 10:41:29,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:29,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:29,703 INFO L87 Difference]: Start difference. First operand 20279 states and 75560 transitions. Second operand 4 states. [2019-12-07 10:41:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:29,785 INFO L93 Difference]: Finished difference Result 19992 states and 74483 transitions. [2019-12-07 10:41:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:29,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:41:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:29,819 INFO L225 Difference]: With dead ends: 19992 [2019-12-07 10:41:29,819 INFO L226 Difference]: Without dead ends: 19992 [2019-12-07 10:41:29,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2019-12-07 10:41:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 19992. [2019-12-07 10:41:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-12-07 10:41:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 74483 transitions. [2019-12-07 10:41:30,177 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 74483 transitions. Word has length 19 [2019-12-07 10:41:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:30,177 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 74483 transitions. [2019-12-07 10:41:30,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 74483 transitions. [2019-12-07 10:41:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:41:30,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:30,183 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] [2019-12-07 10:41:30,183 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:30,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1090694034, now seen corresponding path program 1 times [2019-12-07 10:41:30,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:30,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118390859] [2019-12-07 10:41:30,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:30,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118390859] [2019-12-07 10:41:30,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:30,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:41:30,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858298538] [2019-12-07 10:41:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:30,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:30,212 INFO L87 Difference]: Start difference. First operand 19992 states and 74483 transitions. Second operand 3 states. [2019-12-07 10:41:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:30,251 INFO L93 Difference]: Finished difference Result 11527 states and 37443 transitions. [2019-12-07 10:41:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:30,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:41:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:30,265 INFO L225 Difference]: With dead ends: 11527 [2019-12-07 10:41:30,266 INFO L226 Difference]: Without dead ends: 11527 [2019-12-07 10:41:30,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11527 states. [2019-12-07 10:41:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11527 to 11527. [2019-12-07 10:41:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11527 states. [2019-12-07 10:41:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11527 states to 11527 states and 37443 transitions. [2019-12-07 10:41:30,430 INFO L78 Accepts]: Start accepts. Automaton has 11527 states and 37443 transitions. Word has length 20 [2019-12-07 10:41:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:30,431 INFO L462 AbstractCegarLoop]: Abstraction has 11527 states and 37443 transitions. [2019-12-07 10:41:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11527 states and 37443 transitions. [2019-12-07 10:41:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:41:30,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:30,434 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] [2019-12-07 10:41:30,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -586691094, now seen corresponding path program 1 times [2019-12-07 10:41:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:30,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905076859] [2019-12-07 10:41:30,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:30,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905076859] [2019-12-07 10:41:30,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:30,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:41:30,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016103267] [2019-12-07 10:41:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:30,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:30,466 INFO L87 Difference]: Start difference. First operand 11527 states and 37443 transitions. Second operand 3 states. [2019-12-07 10:41:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:30,510 INFO L93 Difference]: Finished difference Result 11502 states and 37369 transitions. [2019-12-07 10:41:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:30,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:41:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:30,525 INFO L225 Difference]: With dead ends: 11502 [2019-12-07 10:41:30,525 INFO L226 Difference]: Without dead ends: 11502 [2019-12-07 10:41:30,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11502 states. [2019-12-07 10:41:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11502 to 11502. [2019-12-07 10:41:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-12-07 10:41:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 37369 transitions. [2019-12-07 10:41:30,716 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 37369 transitions. Word has length 21 [2019-12-07 10:41:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:30,716 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 37369 transitions. [2019-12-07 10:41:30,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 37369 transitions. [2019-12-07 10:41:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:41:30,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:30,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:30,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1095736327, now seen corresponding path program 1 times [2019-12-07 10:41:30,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:30,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578645304] [2019-12-07 10:41:30,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:30,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578645304] [2019-12-07 10:41:30,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:30,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:30,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834712396] [2019-12-07 10:41:30,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:30,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:30,750 INFO L87 Difference]: Start difference. First operand 11502 states and 37369 transitions. Second operand 4 states. [2019-12-07 10:41:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:30,804 INFO L93 Difference]: Finished difference Result 17660 states and 57549 transitions. [2019-12-07 10:41:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:41:30,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:41:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:30,816 INFO L225 Difference]: With dead ends: 17660 [2019-12-07 10:41:30,816 INFO L226 Difference]: Without dead ends: 8952 [2019-12-07 10:41:30,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2019-12-07 10:41:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 8952. [2019-12-07 10:41:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8952 states. [2019-12-07 10:41:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 28931 transitions. [2019-12-07 10:41:30,944 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 28931 transitions. Word has length 22 [2019-12-07 10:41:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:30,944 INFO L462 AbstractCegarLoop]: Abstraction has 8952 states and 28931 transitions. [2019-12-07 10:41:30,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 28931 transitions. [2019-12-07 10:41:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:41:30,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:30,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:30,947 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash -38213151, now seen corresponding path program 2 times [2019-12-07 10:41:30,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:30,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364294425] [2019-12-07 10:41:30,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:30,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364294425] [2019-12-07 10:41:30,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:30,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:30,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544765348] [2019-12-07 10:41:30,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:41:30,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:30,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:41:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:30,973 INFO L87 Difference]: Start difference. First operand 8952 states and 28931 transitions. Second operand 4 states. [2019-12-07 10:41:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:30,991 INFO L93 Difference]: Finished difference Result 2139 states and 5647 transitions. [2019-12-07 10:41:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:41:30,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:41:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:30,993 INFO L225 Difference]: With dead ends: 2139 [2019-12-07 10:41:30,993 INFO L226 Difference]: Without dead ends: 2139 [2019-12-07 10:41:30,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:41:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-12-07 10:41:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-12-07 10:41:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-12-07 10:41:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 5647 transitions. [2019-12-07 10:41:31,014 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 5647 transitions. Word has length 22 [2019-12-07 10:41:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,014 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 5647 transitions. [2019-12-07 10:41:31,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:41:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 5647 transitions. [2019-12-07 10:41:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:41:31,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:31,016 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-12-07 10:41:31,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431428478] [2019-12-07 10:41:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:31,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431428478] [2019-12-07 10:41:31,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:31,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:31,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717184087] [2019-12-07 10:41:31,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:41:31,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:41:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:31,049 INFO L87 Difference]: Start difference. First operand 2139 states and 5647 transitions. Second operand 5 states. [2019-12-07 10:41:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:31,169 INFO L93 Difference]: Finished difference Result 2884 states and 7387 transitions. [2019-12-07 10:41:31,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:41:31,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 10:41:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:31,172 INFO L225 Difference]: With dead ends: 2884 [2019-12-07 10:41:31,173 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 10:41:31,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:41:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 10:41:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2193. [2019-12-07 10:41:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-12-07 10:41:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5754 transitions. [2019-12-07 10:41:31,198 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5754 transitions. Word has length 29 [2019-12-07 10:41:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 5754 transitions. [2019-12-07 10:41:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:41:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5754 transitions. [2019-12-07 10:41:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:41:31,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:31,200 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1377421728, now seen corresponding path program 1 times [2019-12-07 10:41:31,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830128067] [2019-12-07 10:41:31,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:31,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830128067] [2019-12-07 10:41:31,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:31,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:31,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634387105] [2019-12-07 10:41:31,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:41:31,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:41:31,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:31,226 INFO L87 Difference]: Start difference. First operand 2193 states and 5754 transitions. Second operand 3 states. [2019-12-07 10:41:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:31,256 INFO L93 Difference]: Finished difference Result 2593 states and 6438 transitions. [2019-12-07 10:41:31,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:41:31,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 10:41:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:31,258 INFO L225 Difference]: With dead ends: 2593 [2019-12-07 10:41:31,258 INFO L226 Difference]: Without dead ends: 2593 [2019-12-07 10:41:31,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:41:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-12-07 10:41:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2157. [2019-12-07 10:41:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-12-07 10:41:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 5350 transitions. [2019-12-07 10:41:31,281 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 5350 transitions. Word has length 29 [2019-12-07 10:41:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,281 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 5350 transitions. [2019-12-07 10:41:31,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:41:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 5350 transitions. [2019-12-07 10:41:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:41:31,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,283 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] [2019-12-07 10:41:31,283 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -834134890, now seen corresponding path program 1 times [2019-12-07 10:41:31,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56240057] [2019-12-07 10:41:31,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:31,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56240057] [2019-12-07 10:41:31,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:31,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:41:31,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615699061] [2019-12-07 10:41:31,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:41:31,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:31,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:41:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:31,323 INFO L87 Difference]: Start difference. First operand 2157 states and 5350 transitions. Second operand 5 states. [2019-12-07 10:41:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:31,450 INFO L93 Difference]: Finished difference Result 2648 states and 6508 transitions. [2019-12-07 10:41:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:41:31,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 10:41:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:31,452 INFO L225 Difference]: With dead ends: 2648 [2019-12-07 10:41:31,452 INFO L226 Difference]: Without dead ends: 2565 [2019-12-07 10:41:31,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:41:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-12-07 10:41:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2031. [2019-12-07 10:41:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-12-07 10:41:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 5056 transitions. [2019-12-07 10:41:31,473 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 5056 transitions. Word has length 30 [2019-12-07 10:41:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,473 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 5056 transitions. [2019-12-07 10:41:31,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:41:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 5056 transitions. [2019-12-07 10:41:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:41:31,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:31,475 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1660300154, now seen corresponding path program 1 times [2019-12-07 10:41:31,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414434813] [2019-12-07 10:41:31,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:31,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414434813] [2019-12-07 10:41:31,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:31,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:41:31,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981969747] [2019-12-07 10:41:31,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:41:31,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:41:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:31,516 INFO L87 Difference]: Start difference. First operand 2031 states and 5056 transitions. Second operand 5 states. [2019-12-07 10:41:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:31,539 INFO L93 Difference]: Finished difference Result 1223 states and 3152 transitions. [2019-12-07 10:41:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:41:31,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:41:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:31,540 INFO L225 Difference]: With dead ends: 1223 [2019-12-07 10:41:31,540 INFO L226 Difference]: Without dead ends: 1223 [2019-12-07 10:41:31,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:41:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-07 10:41:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2019-12-07 10:41:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 10:41:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3152 transitions. [2019-12-07 10:41:31,550 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3152 transitions. Word has length 31 [2019-12-07 10:41:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,551 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3152 transitions. [2019-12-07 10:41:31,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:41:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3152 transitions. [2019-12-07 10:41:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:41:31,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,553 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] [2019-12-07 10:41:31,553 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 204691235, now seen corresponding path program 1 times [2019-12-07 10:41:31,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917624736] [2019-12-07 10:41:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:41:31,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917624736] [2019-12-07 10:41:31,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:41:31,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:41:31,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476083547] [2019-12-07 10:41:31,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:41:31,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:41:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:41:31,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:41:31,612 INFO L87 Difference]: Start difference. First operand 1223 states and 3152 transitions. Second operand 7 states. [2019-12-07 10:41:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:31,774 INFO L93 Difference]: Finished difference Result 3339 states and 8535 transitions. [2019-12-07 10:41:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:41:31,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 10:41:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:31,776 INFO L225 Difference]: With dead ends: 3339 [2019-12-07 10:41:31,776 INFO L226 Difference]: Without dead ends: 2223 [2019-12-07 10:41:31,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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 10:41:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-12-07 10:41:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1375. [2019-12-07 10:41:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-12-07 10:41:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3521 transitions. [2019-12-07 10:41:31,791 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 3521 transitions. Word has length 45 [2019-12-07 10:41:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:31,791 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 3521 transitions. [2019-12-07 10:41:31,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:41:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 3521 transitions. [2019-12-07 10:41:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:41:31,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:31,793 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] [2019-12-07 10:41:31,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:41:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 2 times [2019-12-07 10:41:31,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:41:31,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750126757] [2019-12-07 10:41:31,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:41:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:41:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:41:31,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:41:31,851 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:41:31,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_25|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_36| 4) |v_#length_25|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36| 1) |v_#valid_72|) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_36|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36|) |v_ULTIMATE.start_main_~#t852~0.offset_25| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_25|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-07 10:41:31,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-07 10:41:31,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-12-07 10:41:31,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In146337434 ~z$w_buff1~0_Out146337434) (not (= 0 P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434)) (= ~z$w_buff0_used~0_Out146337434 1) (= |P2Thread1of1ForFork0_#in~arg.offset_In146337434| P2Thread1of1ForFork0_~arg.offset_Out146337434) (= 1 ~z$w_buff0~0_Out146337434) (= (ite (not (and (not (= (mod ~z$w_buff0_used~0_Out146337434 256) 0)) (not (= (mod ~z$w_buff1_used~0_Out146337434 256) 0)))) 1 0) |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|) (= ~z$w_buff1_used~0_Out146337434 ~z$w_buff0_used~0_In146337434) (= |P2Thread1of1ForFork0_#in~arg.base_In146337434| P2Thread1of1ForFork0_~arg.base_Out146337434) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In146337434|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146337434, ~z$w_buff0~0=~z$w_buff0~0_In146337434, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In146337434|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out146337434, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In146337434|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out146337434, ~z$w_buff0~0=~z$w_buff0~0_Out146337434, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out146337434, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out146337434, ~z$w_buff1~0=~z$w_buff1~0_Out146337434, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In146337434|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:41:31,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:41:31,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1465898195 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1465898195 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1465898195|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1465898195 |P2Thread1of1ForFork0_#t~ite28_Out1465898195|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1465898195, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1465898195} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1465898195|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1465898195, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1465898195} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:41:31,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-280673720 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-280673720 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-280673720 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-280673720 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite29_Out-280673720|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-280673720 |P2Thread1of1ForFork0_#t~ite29_Out-280673720|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-280673720, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-280673720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-280673720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-280673720} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-280673720, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-280673720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-280673720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-280673720, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-280673720|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:41:31,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-947212089 ~z$r_buff0_thd3~0_Out-947212089)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-947212089 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-947212089 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd3~0_Out-947212089) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-947212089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-947212089} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-947212089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-947212089, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-947212089|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 10:41:31,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In340163717 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In340163717 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In340163717 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In340163717 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite31_Out340163717|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In340163717 |P2Thread1of1ForFork0_#t~ite31_Out340163717|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In340163717, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In340163717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In340163717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In340163717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In340163717, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In340163717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In340163717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In340163717, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out340163717|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:41:31,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:41:31,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:41:31,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:41:31,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:41:31,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1319943303 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1319943303 256) 0))) (or (and (= ~z~0_In-1319943303 |ULTIMATE.start_main_#t~ite35_Out-1319943303|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-1319943303 |ULTIMATE.start_main_#t~ite35_Out-1319943303|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1319943303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1319943303, ~z$w_buff1~0=~z$w_buff1~0_In-1319943303, ~z~0=~z~0_In-1319943303} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1319943303, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1319943303|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1319943303, ~z$w_buff1~0=~z$w_buff1~0_In-1319943303, ~z~0=~z~0_In-1319943303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 10:41:31,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 10:41:31,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2023923834 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2023923834 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2023923834 |ULTIMATE.start_main_#t~ite37_Out-2023923834|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2023923834|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2023923834|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:41:31,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-364999963 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-364999963 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-364999963 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-364999963 256) 0))) (or (and (= ~z$w_buff1_used~0_In-364999963 |ULTIMATE.start_main_#t~ite38_Out-364999963|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out-364999963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364999963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364999963} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364999963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364999963, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-364999963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:41:31,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1480232502 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1480232502 256)))) (or (and (= ~z$r_buff0_thd0~0_In1480232502 |ULTIMATE.start_main_#t~ite39_Out1480232502|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out1480232502|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480232502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1480232502} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480232502, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1480232502|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1480232502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:41:31,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1645696350 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1645696350 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1645696350 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1645696350 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1645696350| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1645696350| ~z$r_buff1_thd0~0_In1645696350) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1645696350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645696350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645696350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645696350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1645696350, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1645696350|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645696350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645696350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645696350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:41:31,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:41:31,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:41:31 BasicIcfg [2019-12-07 10:41:31,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:41:31,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:41:31,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:41:31,917 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:41:31,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:41:20" (3/4) ... [2019-12-07 10:41:31,919 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:41:31,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_25|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_36| 4) |v_#length_25|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36| 1) |v_#valid_72|) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_36|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_36|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_36|) |v_ULTIMATE.start_main_~#t852~0.offset_25| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_25|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_25|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_31|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-07 10:41:31,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-07 10:41:31,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-12-07 10:41:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In146337434 ~z$w_buff1~0_Out146337434) (not (= 0 P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434)) (= ~z$w_buff0_used~0_Out146337434 1) (= |P2Thread1of1ForFork0_#in~arg.offset_In146337434| P2Thread1of1ForFork0_~arg.offset_Out146337434) (= 1 ~z$w_buff0~0_Out146337434) (= (ite (not (and (not (= (mod ~z$w_buff0_used~0_Out146337434 256) 0)) (not (= (mod ~z$w_buff1_used~0_Out146337434 256) 0)))) 1 0) |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|) (= ~z$w_buff1_used~0_Out146337434 ~z$w_buff0_used~0_In146337434) (= |P2Thread1of1ForFork0_#in~arg.base_In146337434| P2Thread1of1ForFork0_~arg.base_Out146337434) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In146337434|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146337434, ~z$w_buff0~0=~z$w_buff0~0_In146337434, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In146337434|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out146337434, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out146337434|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In146337434|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out146337434, ~z$w_buff0~0=~z$w_buff0~0_Out146337434, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out146337434, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out146337434, ~z$w_buff1~0=~z$w_buff1~0_Out146337434, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In146337434|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out146337434} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:41:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:41:31,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1465898195 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1465898195 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1465898195|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1465898195 |P2Thread1of1ForFork0_#t~ite28_Out1465898195|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1465898195, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1465898195} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1465898195|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1465898195, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1465898195} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:41:31,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-280673720 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-280673720 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-280673720 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-280673720 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite29_Out-280673720|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-280673720 |P2Thread1of1ForFork0_#t~ite29_Out-280673720|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-280673720, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-280673720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-280673720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-280673720} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-280673720, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-280673720, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-280673720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-280673720, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-280673720|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:41:31,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-947212089 ~z$r_buff0_thd3~0_Out-947212089)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-947212089 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-947212089 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd3~0_Out-947212089) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-947212089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-947212089} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-947212089, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-947212089, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-947212089|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 10:41:31,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In340163717 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In340163717 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In340163717 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In340163717 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite31_Out340163717|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In340163717 |P2Thread1of1ForFork0_#t~ite31_Out340163717|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In340163717, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In340163717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In340163717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In340163717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In340163717, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In340163717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In340163717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In340163717, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out340163717|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:41:31,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:41:31,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:41:31,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:41:31,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:41:31,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1319943303 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1319943303 256) 0))) (or (and (= ~z~0_In-1319943303 |ULTIMATE.start_main_#t~ite35_Out-1319943303|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-1319943303 |ULTIMATE.start_main_#t~ite35_Out-1319943303|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1319943303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1319943303, ~z$w_buff1~0=~z$w_buff1~0_In-1319943303, ~z~0=~z~0_In-1319943303} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1319943303, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1319943303|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1319943303, ~z$w_buff1~0=~z$w_buff1~0_In-1319943303, ~z~0=~z~0_In-1319943303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 10:41:31,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 10:41:31,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2023923834 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2023923834 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2023923834 |ULTIMATE.start_main_#t~ite37_Out-2023923834|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2023923834|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2023923834|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:41:31,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-364999963 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-364999963 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-364999963 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-364999963 256) 0))) (or (and (= ~z$w_buff1_used~0_In-364999963 |ULTIMATE.start_main_#t~ite38_Out-364999963|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out-364999963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364999963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364999963} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-364999963, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364999963, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-364999963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:41:31,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1480232502 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1480232502 256)))) (or (and (= ~z$r_buff0_thd0~0_In1480232502 |ULTIMATE.start_main_#t~ite39_Out1480232502|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out1480232502|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480232502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1480232502} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1480232502, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1480232502|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1480232502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:41:31,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1645696350 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1645696350 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1645696350 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1645696350 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1645696350| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1645696350| ~z$r_buff1_thd0~0_In1645696350) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1645696350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645696350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645696350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645696350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1645696350, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1645696350|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645696350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1645696350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645696350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:41:31,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:41:31,983 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_feadb19a-7013-49d3-822a-f6a671c7f712/bin/uautomizer/witness.graphml [2019-12-07 10:41:31,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:41:31,984 INFO L168 Benchmark]: Toolchain (without parser) took 12081.55 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 819.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,985 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:41:31,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,985 INFO L168 Benchmark]: Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:41:31,986 INFO L168 Benchmark]: RCFGBuilder took 363.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,986 INFO L168 Benchmark]: TraceAbstraction took 11214.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 885.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.4 MB). Peak memory consumption was 768.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,986 INFO L168 Benchmark]: Witness Printer took 66.22 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:41:31,988 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11214.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 885.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.4 MB). Peak memory consumption was 768.6 MB. Max. memory is 11.5 GB. * Witness Printer took 66.22 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L836] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 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) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 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)) [L769] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 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)) [L770] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 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)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 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)) [L773] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] 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)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L842] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 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 [L845] 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 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1983 SDtfs, 1694 SDslu, 3010 SDs, 0 SdLazy, 952 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21928occurred 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: 4.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 15756 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 35199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...