./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_tso.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_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/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 66c3784ad0971b0dfab5229f278f32fbe08197da .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:54:44,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:54:44,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:54:44,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:54:44,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:54:44,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:54:44,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:54:44,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:54:44,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:54:44,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:54:44,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:54:44,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:54:44,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:54:44,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:54:44,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:54:44,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:54:44,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:54:44,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:54:44,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:54:44,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:54:44,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:54:44,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:54:44,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:54:44,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:54:44,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:54:44,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:54:44,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:54:44,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:54:44,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:54:44,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:54:44,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:54:44,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:54:44,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:54:44,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:54:44,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:54:44,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:54:44,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:54:44,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:54:44,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:54:44,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:54:44,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:54:44,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:54:44,879 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:54:44,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:54:44,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:54:44,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:54:44,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:54:44,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:54:44,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:54:44,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:54:44,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:54:44,883 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:54:44,883 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_1fadbab1-db2c-4d37-8ae7-4c577773b38b/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 -> 66c3784ad0971b0dfab5229f278f32fbe08197da [2019-12-07 17:54:44,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:54:44,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:54:45,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:54:45,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:54:45,002 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:54:45,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i [2019-12-07 17:54:45,044 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/data/371e7e1f8/b86eccb2940f42538ec0cb643266651e/FLAG33b8806c2 [2019-12-07 17:54:45,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:54:45,555 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i [2019-12-07 17:54:45,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/data/371e7e1f8/b86eccb2940f42538ec0cb643266651e/FLAG33b8806c2 [2019-12-07 17:54:46,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/data/371e7e1f8/b86eccb2940f42538ec0cb643266651e [2019-12-07 17:54:46,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:54:46,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:54:46,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:54:46,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:54:46,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:54:46,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46, skipping insertion in model container [2019-12-07 17:54:46,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:54:46,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:54:46,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:54:46,390 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:54:46,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:54:46,486 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:54:46,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46 WrapperNode [2019-12-07 17:54:46,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:54:46,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:54:46,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:54:46,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:54:46,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:54:46,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:54:46,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:54:46,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:54:46,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... [2019-12-07 17:54:46,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:54:46,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:54:46,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:54:46,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:54:46,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:54:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:54:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:54:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:54:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:54:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:54:46,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:54:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:54:46,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:54:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:54:46,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:54:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:54:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:54:46,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:54:46,603 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:54:47,029 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:54:47,030 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:54:47,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:47 BoogieIcfgContainer [2019-12-07 17:54:47,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:54:47,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:54:47,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:54:47,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:54:47,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:54:46" (1/3) ... [2019-12-07 17:54:47,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cb397b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:54:47, skipping insertion in model container [2019-12-07 17:54:47,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:54:46" (2/3) ... [2019-12-07 17:54:47,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cb397b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:54:47, skipping insertion in model container [2019-12-07 17:54:47,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:47" (3/3) ... [2019-12-07 17:54:47,036 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.opt.i [2019-12-07 17:54:47,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:54:47,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:54:47,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:54:47,049 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:54:47,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:54:47,122 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:54:47,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:54:47,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:54:47,135 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:54:47,135 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:54:47,135 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:54:47,135 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:54:47,135 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:54:47,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:54:47,146 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 17:54:47,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 17:54:47,210 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 17:54:47,211 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:54:47,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:54:47,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 17:54:47,281 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 17:54:47,282 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:54:47,290 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:54:47,314 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 17:54:47,315 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:54:50,865 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 17:54:51,095 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 17:54:51,201 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 17:54:51,201 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 17:54:51,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 17:54:53,693 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 17:54:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 17:54:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:54:53,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:53,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:53,736 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 17:54:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 17:54:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:53,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475890915] [2019-12-07 17:54:53,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:53,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475890915] [2019-12-07 17:54:53,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:53,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:54:53,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940849650] [2019-12-07 17:54:53,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:54:53,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:54:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:53,908 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 17:54:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:54,291 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 17:54:54,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:54,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:54:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:54,506 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 17:54:54,506 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 17:54:54,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:54:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 17:54:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 17:54:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 17:54:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 17:54:55,954 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 17:54:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:55,955 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 17:54:55,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:54:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 17:54:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:54:55,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:55,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:55,959 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 17:54:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 17:54:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:55,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12119351] [2019-12-07 17:54:55,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12119351] [2019-12-07 17:54:56,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:56,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:56,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393738063] [2019-12-07 17:54:56,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:56,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:56,020 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 4 states. [2019-12-07 17:54:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:56,628 INFO L93 Difference]: Finished difference Result 61966 states and 244788 transitions. [2019-12-07 17:54:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:54:56,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:54:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:56,789 INFO L225 Difference]: With dead ends: 61966 [2019-12-07 17:54:56,789 INFO L226 Difference]: Without dead ends: 61934 [2019-12-07 17:54:56,790 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 17:54:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61934 states. [2019-12-07 17:54:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61934 to 60400. [2019-12-07 17:54:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60400 states. [2019-12-07 17:54:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60400 states to 60400 states and 239955 transitions. [2019-12-07 17:54:58,457 INFO L78 Accepts]: Start accepts. Automaton has 60400 states and 239955 transitions. Word has length 13 [2019-12-07 17:54:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:58,457 INFO L462 AbstractCegarLoop]: Abstraction has 60400 states and 239955 transitions. [2019-12-07 17:54:58,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60400 states and 239955 transitions. [2019-12-07 17:54:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:54:58,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:58,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:54:58,463 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 17:54:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 17:54:58,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:58,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069368904] [2019-12-07 17:54:58,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:54:58,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069368904] [2019-12-07 17:54:58,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:58,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:58,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838010063] [2019-12-07 17:54:58,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:58,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:58,524 INFO L87 Difference]: Start difference. First operand 60400 states and 239955 transitions. Second operand 4 states. [2019-12-07 17:54:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:58,998 INFO L93 Difference]: Finished difference Result 76452 states and 299517 transitions. [2019-12-07 17:54:58,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:54:58,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:54:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:00,258 INFO L225 Difference]: With dead ends: 76452 [2019-12-07 17:55:00,258 INFO L226 Difference]: Without dead ends: 76426 [2019-12-07 17:55:00,259 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 17:55:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76426 states. [2019-12-07 17:55:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76426 to 68802. [2019-12-07 17:55:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68802 states. [2019-12-07 17:55:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68802 states to 68802 states and 271884 transitions. [2019-12-07 17:55:02,049 INFO L78 Accepts]: Start accepts. Automaton has 68802 states and 271884 transitions. Word has length 16 [2019-12-07 17:55:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:02,049 INFO L462 AbstractCegarLoop]: Abstraction has 68802 states and 271884 transitions. [2019-12-07 17:55:02,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 68802 states and 271884 transitions. [2019-12-07 17:55:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:55:02,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:02,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:02,054 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 17:55:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 17:55:02,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:02,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010877524] [2019-12-07 17:55:02,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:02,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010877524] [2019-12-07 17:55:02,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:02,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:02,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072127194] [2019-12-07 17:55:02,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:02,083 INFO L87 Difference]: Start difference. First operand 68802 states and 271884 transitions. Second operand 3 states. [2019-12-07 17:55:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:02,607 INFO L93 Difference]: Finished difference Result 116968 states and 442545 transitions. [2019-12-07 17:55:02,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:02,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:55:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:02,888 INFO L225 Difference]: With dead ends: 116968 [2019-12-07 17:55:02,889 INFO L226 Difference]: Without dead ends: 116968 [2019-12-07 17:55:02,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116968 states. [2019-12-07 17:55:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116968 to 104212. [2019-12-07 17:55:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104212 states. [2019-12-07 17:55:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104212 states to 104212 states and 399885 transitions. [2019-12-07 17:55:05,811 INFO L78 Accepts]: Start accepts. Automaton has 104212 states and 399885 transitions. Word has length 17 [2019-12-07 17:55:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:05,811 INFO L462 AbstractCegarLoop]: Abstraction has 104212 states and 399885 transitions. [2019-12-07 17:55:05,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 104212 states and 399885 transitions. [2019-12-07 17:55:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:55:05,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:05,820 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 17:55:05,820 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 17:55:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1754315208, now seen corresponding path program 1 times [2019-12-07 17:55:05,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:05,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968941750] [2019-12-07 17:55:05,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:05,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968941750] [2019-12-07 17:55:05,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:05,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:05,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666221862] [2019-12-07 17:55:05,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:05,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:05,850 INFO L87 Difference]: Start difference. First operand 104212 states and 399885 transitions. Second operand 3 states. [2019-12-07 17:55:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:06,043 INFO L93 Difference]: Finished difference Result 57368 states and 191630 transitions. [2019-12-07 17:55:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:06,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:55:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:06,149 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 17:55:06,149 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 17:55:06,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 17:55:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 57368. [2019-12-07 17:55:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-12-07 17:55:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 191630 transitions. [2019-12-07 17:55:07,496 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 191630 transitions. Word has length 18 [2019-12-07 17:55:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:07,496 INFO L462 AbstractCegarLoop]: Abstraction has 57368 states and 191630 transitions. [2019-12-07 17:55:07,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 191630 transitions. [2019-12-07 17:55:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:07,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:07,500 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 17:55:07,500 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 17:55:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1903393538, now seen corresponding path program 1 times [2019-12-07 17:55:07,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:07,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185950671] [2019-12-07 17:55:07,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:07,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185950671] [2019-12-07 17:55:07,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:07,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:07,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331037727] [2019-12-07 17:55:07,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:07,547 INFO L87 Difference]: Start difference. First operand 57368 states and 191630 transitions. Second operand 3 states. [2019-12-07 17:55:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:07,732 INFO L93 Difference]: Finished difference Result 57368 states and 189042 transitions. [2019-12-07 17:55:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:07,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:55:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:07,834 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 17:55:07,834 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 17:55:07,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 17:55:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 56683. [2019-12-07 17:55:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56683 states. [2019-12-07 17:55:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56683 states to 56683 states and 187059 transitions. [2019-12-07 17:55:08,977 INFO L78 Accepts]: Start accepts. Automaton has 56683 states and 187059 transitions. Word has length 19 [2019-12-07 17:55:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:08,978 INFO L462 AbstractCegarLoop]: Abstraction has 56683 states and 187059 transitions. [2019-12-07 17:55:08,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 56683 states and 187059 transitions. [2019-12-07 17:55:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:08,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:08,981 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 17:55:08,981 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 17:55:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -620191314, now seen corresponding path program 1 times [2019-12-07 17:55:08,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:08,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626122919] [2019-12-07 17:55:08,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:09,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626122919] [2019-12-07 17:55:09,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:09,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:09,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892439084] [2019-12-07 17:55:09,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:09,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:09,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:09,015 INFO L87 Difference]: Start difference. First operand 56683 states and 187059 transitions. Second operand 4 states. [2019-12-07 17:55:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:09,047 INFO L93 Difference]: Finished difference Result 8176 states and 22619 transitions. [2019-12-07 17:55:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:55:09,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:55:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:09,057 INFO L225 Difference]: With dead ends: 8176 [2019-12-07 17:55:09,057 INFO L226 Difference]: Without dead ends: 8176 [2019-12-07 17:55:09,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-12-07 17:55:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-12-07 17:55:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-12-07 17:55:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 22619 transitions. [2019-12-07 17:55:09,147 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 22619 transitions. Word has length 19 [2019-12-07 17:55:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:09,148 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 22619 transitions. [2019-12-07 17:55:09,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 22619 transitions. [2019-12-07 17:55:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:55:09,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:09,149 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 17:55:09,149 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 17:55:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 17:55:09,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:09,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180345120] [2019-12-07 17:55:09,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:09,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180345120] [2019-12-07 17:55:09,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:09,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:55:09,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104562654] [2019-12-07 17:55:09,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:09,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:09,178 INFO L87 Difference]: Start difference. First operand 8176 states and 22619 transitions. Second operand 4 states. [2019-12-07 17:55:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:09,339 INFO L93 Difference]: Finished difference Result 10377 states and 28179 transitions. [2019-12-07 17:55:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:09,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:55:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:09,353 INFO L225 Difference]: With dead ends: 10377 [2019-12-07 17:55:09,353 INFO L226 Difference]: Without dead ends: 10377 [2019-12-07 17:55:09,353 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 17:55:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2019-12-07 17:55:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 8186. [2019-12-07 17:55:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-12-07 17:55:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 22651 transitions. [2019-12-07 17:55:09,458 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 22651 transitions. Word has length 19 [2019-12-07 17:55:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:09,458 INFO L462 AbstractCegarLoop]: Abstraction has 8186 states and 22651 transitions. [2019-12-07 17:55:09,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 22651 transitions. [2019-12-07 17:55:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:55:09,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:09,463 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 17:55:09,464 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 17:55:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 17:55:09,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:09,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492911996] [2019-12-07 17:55:09,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:09,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492911996] [2019-12-07 17:55:09,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:09,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:09,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117036397] [2019-12-07 17:55:09,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:09,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:09,505 INFO L87 Difference]: Start difference. First operand 8186 states and 22651 transitions. Second operand 5 states. [2019-12-07 17:55:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:09,742 INFO L93 Difference]: Finished difference Result 10954 states and 29336 transitions. [2019-12-07 17:55:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:55:09,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 17:55:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:09,754 INFO L225 Difference]: With dead ends: 10954 [2019-12-07 17:55:09,754 INFO L226 Difference]: Without dead ends: 10953 [2019-12-07 17:55:09,754 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 17:55:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10953 states. [2019-12-07 17:55:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10953 to 10182. [2019-12-07 17:55:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-12-07 17:55:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 27669 transitions. [2019-12-07 17:55:10,157 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 27669 transitions. Word has length 31 [2019-12-07 17:55:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:10,158 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 27669 transitions. [2019-12-07 17:55:10,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 27669 transitions. [2019-12-07 17:55:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:55:10,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:10,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:10,165 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 17:55:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1183609133, now seen corresponding path program 1 times [2019-12-07 17:55:10,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:10,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632680021] [2019-12-07 17:55:10,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:10,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632680021] [2019-12-07 17:55:10,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:10,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:55:10,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927145615] [2019-12-07 17:55:10,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:55:10,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:55:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:10,189 INFO L87 Difference]: Start difference. First operand 10182 states and 27669 transitions. Second operand 3 states. [2019-12-07 17:55:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:10,248 INFO L93 Difference]: Finished difference Result 10956 states and 28041 transitions. [2019-12-07 17:55:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:55:10,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 17:55:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:10,257 INFO L225 Difference]: With dead ends: 10956 [2019-12-07 17:55:10,257 INFO L226 Difference]: Without dead ends: 10956 [2019-12-07 17:55:10,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:55:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2019-12-07 17:55:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10312. [2019-12-07 17:55:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-12-07 17:55:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 26596 transitions. [2019-12-07 17:55:10,370 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 26596 transitions. Word has length 34 [2019-12-07 17:55:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:10,371 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 26596 transitions. [2019-12-07 17:55:10,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:55:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 26596 transitions. [2019-12-07 17:55:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:55:10,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:10,379 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] [2019-12-07 17:55:10,379 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 17:55:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1182175862, now seen corresponding path program 1 times [2019-12-07 17:55:10,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:10,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788760595] [2019-12-07 17:55:10,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:10,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788760595] [2019-12-07 17:55:10,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:10,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854342881] [2019-12-07 17:55:10,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:10,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:10,429 INFO L87 Difference]: Start difference. First operand 10312 states and 26596 transitions. Second operand 5 states. [2019-12-07 17:55:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:10,470 INFO L93 Difference]: Finished difference Result 7816 states and 21181 transitions. [2019-12-07 17:55:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:10,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 17:55:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:10,478 INFO L225 Difference]: With dead ends: 7816 [2019-12-07 17:55:10,478 INFO L226 Difference]: Without dead ends: 7816 [2019-12-07 17:55:10,478 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 17:55:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2019-12-07 17:55:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 6702. [2019-12-07 17:55:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2019-12-07 17:55:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 18470 transitions. [2019-12-07 17:55:10,554 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 18470 transitions. Word has length 36 [2019-12-07 17:55:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:10,554 INFO L462 AbstractCegarLoop]: Abstraction has 6702 states and 18470 transitions. [2019-12-07 17:55:10,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 18470 transitions. [2019-12-07 17:55:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:10,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:10,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:10,562 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 17:55:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash 14672455, now seen corresponding path program 1 times [2019-12-07 17:55:10,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:10,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887149062] [2019-12-07 17:55:10,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:10,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887149062] [2019-12-07 17:55:10,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:10,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:10,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827481940] [2019-12-07 17:55:10,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:55:10,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:55:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:10,631 INFO L87 Difference]: Start difference. First operand 6702 states and 18470 transitions. Second operand 4 states. [2019-12-07 17:55:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:10,786 INFO L93 Difference]: Finished difference Result 7568 states and 20537 transitions. [2019-12-07 17:55:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:55:10,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 17:55:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:10,794 INFO L225 Difference]: With dead ends: 7568 [2019-12-07 17:55:10,794 INFO L226 Difference]: Without dead ends: 7568 [2019-12-07 17:55:10,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:55:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2019-12-07 17:55:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 7296. [2019-12-07 17:55:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-12-07 17:55:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 19835 transitions. [2019-12-07 17:55:10,875 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 19835 transitions. Word has length 62 [2019-12-07 17:55:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:10,875 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 19835 transitions. [2019-12-07 17:55:10,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:55:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 19835 transitions. [2019-12-07 17:55:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:10,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:10,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:10,884 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 17:55:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2143606157, now seen corresponding path program 2 times [2019-12-07 17:55:10,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:10,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387839907] [2019-12-07 17:55:10,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:10,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387839907] [2019-12-07 17:55:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:55:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223444512] [2019-12-07 17:55:10,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:55:10,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:55:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:55:10,977 INFO L87 Difference]: Start difference. First operand 7296 states and 19835 transitions. Second operand 6 states. [2019-12-07 17:55:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:11,249 INFO L93 Difference]: Finished difference Result 7953 states and 21383 transitions. [2019-12-07 17:55:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:55:11,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 17:55:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:11,257 INFO L225 Difference]: With dead ends: 7953 [2019-12-07 17:55:11,257 INFO L226 Difference]: Without dead ends: 7953 [2019-12-07 17:55:11,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:55:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2019-12-07 17:55:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7466. [2019-12-07 17:55:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-12-07 17:55:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 20190 transitions. [2019-12-07 17:55:11,345 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 20190 transitions. Word has length 62 [2019-12-07 17:55:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 7466 states and 20190 transitions. [2019-12-07 17:55:11,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:55:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 20190 transitions. [2019-12-07 17:55:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:11,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:11,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:11,354 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 17:55:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2085196129, now seen corresponding path program 3 times [2019-12-07 17:55:11,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:11,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527441874] [2019-12-07 17:55:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:11,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527441874] [2019-12-07 17:55:11,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:11,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:55:11,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37540266] [2019-12-07 17:55:11,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:55:11,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:55:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:55:11,432 INFO L87 Difference]: Start difference. First operand 7466 states and 20190 transitions. Second operand 6 states. [2019-12-07 17:55:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:11,719 INFO L93 Difference]: Finished difference Result 9707 states and 26056 transitions. [2019-12-07 17:55:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:55:11,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 17:55:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:11,728 INFO L225 Difference]: With dead ends: 9707 [2019-12-07 17:55:11,728 INFO L226 Difference]: Without dead ends: 9707 [2019-12-07 17:55:11,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:55:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2019-12-07 17:55:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 7812. [2019-12-07 17:55:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7812 states. [2019-12-07 17:55:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7812 states to 7812 states and 21115 transitions. [2019-12-07 17:55:11,821 INFO L78 Accepts]: Start accepts. Automaton has 7812 states and 21115 transitions. Word has length 62 [2019-12-07 17:55:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:11,821 INFO L462 AbstractCegarLoop]: Abstraction has 7812 states and 21115 transitions. [2019-12-07 17:55:11,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:55:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7812 states and 21115 transitions. [2019-12-07 17:55:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:55:11,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:11,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:11,831 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 17:55:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 4 times [2019-12-07 17:55:11,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:11,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947727106] [2019-12-07 17:55:11,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:11,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947727106] [2019-12-07 17:55:11,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:11,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692332989] [2019-12-07 17:55:11,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:11,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:11,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:11,882 INFO L87 Difference]: Start difference. First operand 7812 states and 21115 transitions. Second operand 5 states. [2019-12-07 17:55:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:12,039 INFO L93 Difference]: Finished difference Result 9677 states and 25623 transitions. [2019-12-07 17:55:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:55:12,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 17:55:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:12,048 INFO L225 Difference]: With dead ends: 9677 [2019-12-07 17:55:12,048 INFO L226 Difference]: Without dead ends: 9677 [2019-12-07 17:55:12,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 17:55:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-07 17:55:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8382. [2019-12-07 17:55:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8382 states. [2019-12-07 17:55:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 22522 transitions. [2019-12-07 17:55:12,142 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 22522 transitions. Word has length 62 [2019-12-07 17:55:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:12,142 INFO L462 AbstractCegarLoop]: Abstraction has 8382 states and 22522 transitions. [2019-12-07 17:55:12,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 22522 transitions. [2019-12-07 17:55:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:12,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:12,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:12,151 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 17:55:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 17:55:12,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:12,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682612594] [2019-12-07 17:55:12,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:12,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682612594] [2019-12-07 17:55:12,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:12,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:12,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807982302] [2019-12-07 17:55:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:12,229 INFO L87 Difference]: Start difference. First operand 8382 states and 22522 transitions. Second operand 5 states. [2019-12-07 17:55:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:12,273 INFO L93 Difference]: Finished difference Result 9252 states and 24402 transitions. [2019-12-07 17:55:12,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:12,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 17:55:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:12,278 INFO L225 Difference]: With dead ends: 9252 [2019-12-07 17:55:12,278 INFO L226 Difference]: Without dead ends: 5057 [2019-12-07 17:55:12,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:55:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2019-12-07 17:55:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 5057. [2019-12-07 17:55:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5057 states. [2019-12-07 17:55:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 11904 transitions. [2019-12-07 17:55:12,324 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 11904 transitions. Word has length 63 [2019-12-07 17:55:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:12,324 INFO L462 AbstractCegarLoop]: Abstraction has 5057 states and 11904 transitions. [2019-12-07 17:55:12,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 11904 transitions. [2019-12-07 17:55:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:12,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:12,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:12,328 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 17:55:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 478203150, now seen corresponding path program 2 times [2019-12-07 17:55:12,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:12,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659693990] [2019-12-07 17:55:12,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:12,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659693990] [2019-12-07 17:55:12,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:12,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:55:12,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248058456] [2019-12-07 17:55:12,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:55:12,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:12,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:55:12,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:55:12,423 INFO L87 Difference]: Start difference. First operand 5057 states and 11904 transitions. Second operand 8 states. [2019-12-07 17:55:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:12,715 INFO L93 Difference]: Finished difference Result 9991 states and 24207 transitions. [2019-12-07 17:55:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:55:12,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 17:55:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:12,722 INFO L225 Difference]: With dead ends: 9991 [2019-12-07 17:55:12,722 INFO L226 Difference]: Without dead ends: 9273 [2019-12-07 17:55:12,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:55:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-12-07 17:55:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 6896. [2019-12-07 17:55:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2019-12-07 17:55:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 16317 transitions. [2019-12-07 17:55:12,800 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 16317 transitions. Word has length 63 [2019-12-07 17:55:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:12,800 INFO L462 AbstractCegarLoop]: Abstraction has 6896 states and 16317 transitions. [2019-12-07 17:55:12,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:55:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 16317 transitions. [2019-12-07 17:55:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:12,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:12,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:12,805 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 17:55:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:12,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1049153716, now seen corresponding path program 3 times [2019-12-07 17:55:12,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:12,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631462519] [2019-12-07 17:55:12,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:12,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631462519] [2019-12-07 17:55:12,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:12,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:55:12,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915297521] [2019-12-07 17:55:12,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:55:12,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:55:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:55:12,906 INFO L87 Difference]: Start difference. First operand 6896 states and 16317 transitions. Second operand 9 states. [2019-12-07 17:55:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:13,212 INFO L93 Difference]: Finished difference Result 9343 states and 22127 transitions. [2019-12-07 17:55:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:55:13,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-07 17:55:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:13,219 INFO L225 Difference]: With dead ends: 9343 [2019-12-07 17:55:13,219 INFO L226 Difference]: Without dead ends: 8577 [2019-12-07 17:55:13,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:55:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8577 states. [2019-12-07 17:55:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8577 to 6496. [2019-12-07 17:55:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-07 17:55:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 15421 transitions. [2019-12-07 17:55:13,327 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 15421 transitions. Word has length 63 [2019-12-07 17:55:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:13,328 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 15421 transitions. [2019-12-07 17:55:13,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:55:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 15421 transitions. [2019-12-07 17:55:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:13,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:13,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:13,333 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1104226676, now seen corresponding path program 4 times [2019-12-07 17:55:13,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:13,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867512467] [2019-12-07 17:55:13,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:13,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867512467] [2019-12-07 17:55:13,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:13,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:55:13,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020758941] [2019-12-07 17:55:13,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:55:13,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:55:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:55:13,410 INFO L87 Difference]: Start difference. First operand 6496 states and 15421 transitions. Second operand 5 states. [2019-12-07 17:55:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:13,446 INFO L93 Difference]: Finished difference Result 7014 states and 16517 transitions. [2019-12-07 17:55:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:55:13,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 17:55:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:13,447 INFO L225 Difference]: With dead ends: 7014 [2019-12-07 17:55:13,447 INFO L226 Difference]: Without dead ends: 592 [2019-12-07 17:55:13,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:55:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-07 17:55:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-12-07 17:55:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-07 17:55:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1201 transitions. [2019-12-07 17:55:13,452 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1201 transitions. Word has length 63 [2019-12-07 17:55:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:13,452 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 1201 transitions. [2019-12-07 17:55:13,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:55:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1201 transitions. [2019-12-07 17:55:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:13,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:13,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:13,453 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 5 times [2019-12-07 17:55:13,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:13,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437899335] [2019-12-07 17:55:13,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:13,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437899335] [2019-12-07 17:55:13,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:13,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:55:13,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360789305] [2019-12-07 17:55:13,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:55:13,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:13,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:55:13,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:55:13,812 INFO L87 Difference]: Start difference. First operand 592 states and 1201 transitions. Second operand 15 states. [2019-12-07 17:55:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:14,951 INFO L93 Difference]: Finished difference Result 906 states and 1808 transitions. [2019-12-07 17:55:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:55:14,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-12-07 17:55:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:14,952 INFO L225 Difference]: With dead ends: 906 [2019-12-07 17:55:14,952 INFO L226 Difference]: Without dead ends: 811 [2019-12-07 17:55:14,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:55:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-07 17:55:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 670. [2019-12-07 17:55:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-07 17:55:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1347 transitions. [2019-12-07 17:55:14,961 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1347 transitions. Word has length 63 [2019-12-07 17:55:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:14,961 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1347 transitions. [2019-12-07 17:55:14,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:55:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1347 transitions. [2019-12-07 17:55:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:14,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:14,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:14,962 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 682706190, now seen corresponding path program 6 times [2019-12-07 17:55:14,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:14,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091688856] [2019-12-07 17:55:14,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:55:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:55:15,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091688856] [2019-12-07 17:55:15,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:55:15,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:55:15,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476860770] [2019-12-07 17:55:15,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:55:15,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:55:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:55:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:55:15,026 INFO L87 Difference]: Start difference. First operand 670 states and 1347 transitions. Second operand 8 states. [2019-12-07 17:55:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:55:15,146 INFO L93 Difference]: Finished difference Result 1149 states and 2297 transitions. [2019-12-07 17:55:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:55:15,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 17:55:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:55:15,147 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 17:55:15,147 INFO L226 Difference]: Without dead ends: 754 [2019-12-07 17:55:15,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:55:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-12-07 17:55:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 598. [2019-12-07 17:55:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 17:55:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1210 transitions. [2019-12-07 17:55:15,152 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1210 transitions. Word has length 63 [2019-12-07 17:55:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:55:15,153 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 1210 transitions. [2019-12-07 17:55:15,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:55:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1210 transitions. [2019-12-07 17:55:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:55:15,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:55:15,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:55:15,153 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:55:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:55:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 7 times [2019-12-07 17:55:15,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:55:15,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930320307] [2019-12-07 17:55:15,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:55:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:55:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:55:15,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:55:15,225 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:55:15,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132|) 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132|) |v_ULTIMATE.start_main_~#t59~0.offset_73| 0)) |v_#memory_int_23|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t59~0.base_132|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132| 1) |v_#valid_167|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t59~0.base_132| 4)) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_ULTIMATE.start_main_~#t59~0.offset_73| 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_56|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t59~0.base=|v_ULTIMATE.start_main_~#t59~0.base_132|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_94|, ULTIMATE.start_main_~#t59~0.offset=|v_ULTIMATE.start_main_~#t59~0.offset_73|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t61~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t60~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t59~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t59~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t61~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~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:55:15,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t60~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t60~0.base_10| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10|) |v_ULTIMATE.start_main_~#t60~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t60~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t60~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_10|, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t60~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:55:15,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t61~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t61~0.base_11| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t61~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11|) |v_ULTIMATE.start_main_~#t61~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t61~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t61~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t61~0.base, #length] because there is no mapped edge [2019-12-07 17:55:15,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:55:15,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1911092492| |P2Thread1of1ForFork0_#t~ite28_Out-1911092492|)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1911092492 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1911092492 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out-1911092492| ~z$w_buff0~0_In-1911092492)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1911092492| ~z$w_buff1~0_In-1911092492) .cse0 (or .cse2 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1911092492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911092492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1911092492, ~z$w_buff1~0=~z$w_buff1~0_In-1911092492} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1911092492|, ~z$w_buff0~0=~z$w_buff0~0_In-1911092492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911092492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1911092492, ~z$w_buff1~0=~z$w_buff1~0_In-1911092492, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1911092492|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:55:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:55:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1920780971 256) 0))) (or (and (= ~z~0_In1920780971 |P2Thread1of1ForFork0_#t~ite48_Out1920780971|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1920780971 |P2Thread1of1ForFork0_#t~ite48_Out1920780971|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1920780971, ~z$flush_delayed~0=~z$flush_delayed~0_In1920780971, ~z~0=~z~0_In1920780971} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1920780971|, ~z$mem_tmp~0=~z$mem_tmp~0_In1920780971, ~z$flush_delayed~0=~z$flush_delayed~0_In1920780971, ~z~0=~z~0_In1920780971} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:55:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:55:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1441010340 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1441010340 256)))) (or (and (= ~z$w_buff0_used~0_In-1441010340 |P2Thread1of1ForFork0_#t~ite51_Out-1441010340|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1441010340|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1441010340, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1441010340} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1441010340, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1441010340, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1441010340|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:55:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1730693772 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1730693772| ~z$mem_tmp~0_In-1730693772) (not .cse0)) (and .cse0 (= ~z~0_In-1730693772 |P1Thread1of1ForFork2_#t~ite25_Out-1730693772|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1730693772, ~z$flush_delayed~0=~z$flush_delayed~0_In-1730693772, ~z~0=~z~0_In-1730693772} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1730693772, ~z$flush_delayed~0=~z$flush_delayed~0_In-1730693772, ~z~0=~z~0_In-1730693772, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1730693772|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:55:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:55:15,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-420754687 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-420754687 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-420754687 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-420754687 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-420754687|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-420754687 |P2Thread1of1ForFork0_#t~ite52_Out-420754687|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-420754687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-420754687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420754687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-420754687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-420754687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-420754687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420754687, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-420754687|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-420754687} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:55:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out522402098 ~z$r_buff0_thd3~0_In522402098)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In522402098 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In522402098 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~z$r_buff0_thd3~0_Out522402098 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In522402098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In522402098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In522402098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out522402098, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out522402098|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:55:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In46557165 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In46557165 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In46557165 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In46557165 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out46557165| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite54_Out46557165| ~z$r_buff1_thd3~0_In46557165) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In46557165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In46557165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In46557165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In46557165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In46557165, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out46557165|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In46557165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In46557165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In46557165} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:55:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:55:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:55:15,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In280533909 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In280533909 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out280533909| |ULTIMATE.start_main_#t~ite58_Out280533909|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite58_Out280533909| ~z$w_buff1~0_In280533909) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out280533909| ~z~0_In280533909) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280533909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280533909, ~z$w_buff1~0=~z$w_buff1~0_In280533909, ~z~0=~z~0_In280533909} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280533909, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out280533909|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280533909, ~z$w_buff1~0=~z$w_buff1~0_In280533909, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out280533909|, ~z~0=~z~0_In280533909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:55:15,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In353657581 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In353657581 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out353657581|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In353657581 |ULTIMATE.start_main_#t~ite60_Out353657581|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353657581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353657581} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out353657581|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353657581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353657581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:55:15,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1283556151 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1283556151 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1283556151 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1283556151 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1283556151|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1283556151 |ULTIMATE.start_main_#t~ite61_Out-1283556151|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1283556151, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283556151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1283556151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283556151} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1283556151, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1283556151|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283556151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1283556151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283556151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:55:15,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1926260076 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1926260076 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1926260076 |ULTIMATE.start_main_#t~ite62_Out1926260076|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1926260076|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1926260076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926260076} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1926260076|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1926260076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926260076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:55:15,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1358640419 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1358640419 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1358640419 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1358640419 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1358640419| ~z$r_buff1_thd0~0_In-1358640419)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1358640419| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1358640419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1358640419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358640419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358640419} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1358640419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1358640419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1358640419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358640419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358640419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:55:15,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:55:15,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:55:15 BasicIcfg [2019-12-07 17:55:15,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:55:15,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:55:15,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:55:15,307 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:55:15,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:54:47" (3/4) ... [2019-12-07 17:55:15,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:55:15,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132|) 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132|) |v_ULTIMATE.start_main_~#t59~0.offset_73| 0)) |v_#memory_int_23|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t59~0.base_132|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132| 1) |v_#valid_167|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t59~0.base_132| 4)) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_ULTIMATE.start_main_~#t59~0.offset_73| 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_56|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t59~0.base=|v_ULTIMATE.start_main_~#t59~0.base_132|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_94|, ULTIMATE.start_main_~#t59~0.offset=|v_ULTIMATE.start_main_~#t59~0.offset_73|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t61~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t60~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t59~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t59~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t61~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~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:55:15,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t60~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t60~0.base_10| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10|) |v_ULTIMATE.start_main_~#t60~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t60~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t60~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_10|, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t60~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:55:15,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t61~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t61~0.base_11| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t61~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11|) |v_ULTIMATE.start_main_~#t61~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t61~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t61~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t61~0.base, #length] because there is no mapped edge [2019-12-07 17:55:15,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:55:15,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1911092492| |P2Thread1of1ForFork0_#t~ite28_Out-1911092492|)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1911092492 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1911092492 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out-1911092492| ~z$w_buff0~0_In-1911092492)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1911092492| ~z$w_buff1~0_In-1911092492) .cse0 (or .cse2 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1911092492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911092492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1911092492, ~z$w_buff1~0=~z$w_buff1~0_In-1911092492} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1911092492|, ~z$w_buff0~0=~z$w_buff0~0_In-1911092492, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911092492, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1911092492, ~z$w_buff1~0=~z$w_buff1~0_In-1911092492, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1911092492|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:55:15,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:55:15,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1920780971 256) 0))) (or (and (= ~z~0_In1920780971 |P2Thread1of1ForFork0_#t~ite48_Out1920780971|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1920780971 |P2Thread1of1ForFork0_#t~ite48_Out1920780971|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1920780971, ~z$flush_delayed~0=~z$flush_delayed~0_In1920780971, ~z~0=~z~0_In1920780971} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1920780971|, ~z$mem_tmp~0=~z$mem_tmp~0_In1920780971, ~z$flush_delayed~0=~z$flush_delayed~0_In1920780971, ~z~0=~z~0_In1920780971} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:55:15,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:55:15,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1441010340 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1441010340 256)))) (or (and (= ~z$w_buff0_used~0_In-1441010340 |P2Thread1of1ForFork0_#t~ite51_Out-1441010340|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1441010340|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1441010340, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1441010340} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1441010340, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1441010340, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1441010340|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:55:15,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1730693772 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1730693772| ~z$mem_tmp~0_In-1730693772) (not .cse0)) (and .cse0 (= ~z~0_In-1730693772 |P1Thread1of1ForFork2_#t~ite25_Out-1730693772|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1730693772, ~z$flush_delayed~0=~z$flush_delayed~0_In-1730693772, ~z~0=~z~0_In-1730693772} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1730693772, ~z$flush_delayed~0=~z$flush_delayed~0_In-1730693772, ~z~0=~z~0_In-1730693772, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1730693772|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:55:15,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:55:15,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-420754687 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-420754687 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-420754687 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-420754687 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-420754687|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-420754687 |P2Thread1of1ForFork0_#t~ite52_Out-420754687|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-420754687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-420754687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420754687, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-420754687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-420754687, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-420754687, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420754687, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-420754687|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-420754687} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:55:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= ~z$r_buff0_thd3~0_Out522402098 ~z$r_buff0_thd3~0_In522402098)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In522402098 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In522402098 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (= ~z$r_buff0_thd3~0_Out522402098 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In522402098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In522402098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In522402098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out522402098, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out522402098|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:55:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In46557165 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In46557165 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In46557165 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In46557165 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out46557165| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite54_Out46557165| ~z$r_buff1_thd3~0_In46557165) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In46557165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In46557165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In46557165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In46557165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In46557165, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out46557165|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In46557165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In46557165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In46557165} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:55:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:55:15,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:55:15,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In280533909 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In280533909 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out280533909| |ULTIMATE.start_main_#t~ite58_Out280533909|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite58_Out280533909| ~z$w_buff1~0_In280533909) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out280533909| ~z~0_In280533909) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280533909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280533909, ~z$w_buff1~0=~z$w_buff1~0_In280533909, ~z~0=~z~0_In280533909} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In280533909, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out280533909|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In280533909, ~z$w_buff1~0=~z$w_buff1~0_In280533909, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out280533909|, ~z~0=~z~0_In280533909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:55:15,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In353657581 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In353657581 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out353657581|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In353657581 |ULTIMATE.start_main_#t~ite60_Out353657581|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353657581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353657581} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out353657581|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In353657581, ~z$w_buff0_used~0=~z$w_buff0_used~0_In353657581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:55:15,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1283556151 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1283556151 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1283556151 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1283556151 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1283556151|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1283556151 |ULTIMATE.start_main_#t~ite61_Out-1283556151|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1283556151, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283556151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1283556151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283556151} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1283556151, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1283556151|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283556151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1283556151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283556151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:55:15,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1926260076 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1926260076 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1926260076 |ULTIMATE.start_main_#t~ite62_Out1926260076|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1926260076|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1926260076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926260076} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1926260076|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1926260076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926260076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:55:15,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1358640419 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1358640419 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1358640419 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1358640419 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1358640419| ~z$r_buff1_thd0~0_In-1358640419)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1358640419| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1358640419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1358640419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358640419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358640419} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1358640419|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1358640419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1358640419, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1358640419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1358640419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:55:15,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:55:15,383 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1fadbab1-db2c-4d37-8ae7-4c577773b38b/bin/uautomizer/witness.graphml [2019-12-07 17:55:15,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:55:15,384 INFO L168 Benchmark]: Toolchain (without parser) took 29307.24 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 938.0 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 675.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,385 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:55:15,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:55:15,385 INFO L168 Benchmark]: Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,386 INFO L168 Benchmark]: RCFGBuilder took 473.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,386 INFO L168 Benchmark]: TraceAbstraction took 28275.54 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 996.7 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 582.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,386 INFO L168 Benchmark]: Witness Printer took 76.45 ms. Allocated memory is still 4.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:55:15,388 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28275.54 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 996.7 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 582.1 MB. Max. memory is 11.5 GB. * Witness Printer took 76.45 ms. Allocated memory is still 4.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t59, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_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] [L847] FCALL, FORK 0 pthread_create(&t60, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, 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] [L849] FCALL, FORK 0 pthread_create(&t61, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, 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] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, 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] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L822] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L770] 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=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L822] 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) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 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) [L771] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L771] 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)) [L772] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L772] 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)) [L773] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L773] 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)) [L774] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=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] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L776] 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)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L824] 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 [L855] EXPR 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4217 SDtfs, 4566 SDslu, 9877 SDs, 0 SdLazy, 4016 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104212occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 36023 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 261593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...