./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/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 3c9d871b0ec3e076c45b0ea77629e1601bdb3a53 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:30:03,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:30:03,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:30:03,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:30:03,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:30:03,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:30:03,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:30:03,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:30:03,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:30:03,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:30:03,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:30:03,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:30:03,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:30:03,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:30:03,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:30:03,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:30:03,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:30:03,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:30:03,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:30:03,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:30:03,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:30:03,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:30:03,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:30:03,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:30:03,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:30:03,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:30:03,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:30:03,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:30:03,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:30:03,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:30:03,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:30:03,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:30:03,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:30:03,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:30:03,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:30:03,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:30:03,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:30:03,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:30:03,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:30:03,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:30:03,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:30:03,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:30:03,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:30:03,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:30:03,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:30:03,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:30:03,949 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:30:03,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:30:03,949 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:30:03,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:30:03,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:30:03,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:30:03,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:30:03,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:30:03,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:30:03,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:30:03,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:30:03,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:30:03,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:30:03,953 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_927d2193-b6c7-45b2-8a09-e7cb8569d0da/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 -> 3c9d871b0ec3e076c45b0ea77629e1601bdb3a53 [2019-12-07 18:30:04,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:30:04,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:30:04,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:30:04,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:30:04,070 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:30:04,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2019-12-07 18:30:04,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/data/5a6f4ae57/70e1a5fbea434c76be899ecb589be68e/FLAG522680090 [2019-12-07 18:30:04,640 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:30:04,641 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2019-12-07 18:30:04,653 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/data/5a6f4ae57/70e1a5fbea434c76be899ecb589be68e/FLAG522680090 [2019-12-07 18:30:05,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/data/5a6f4ae57/70e1a5fbea434c76be899ecb589be68e [2019-12-07 18:30:05,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:30:05,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:30:05,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:30:05,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:30:05,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:30:05,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b5cc88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05, skipping insertion in model container [2019-12-07 18:30:05,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:30:05,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:30:05,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:30:05,439 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:30:05,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:30:05,530 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:30:05,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05 WrapperNode [2019-12-07 18:30:05,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:30:05,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:30:05,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:30:05,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:30:05,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:30:05,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:30:05,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:30:05,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:30:05,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... [2019-12-07 18:30:05,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:30:05,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:30:05,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:30:05,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:30:05,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/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 18:30:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:30:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:30:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:30:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:30:05,637 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:30:05,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:30:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:30:05,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:30:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:30:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:30:05,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:30:05,639 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 18:30:05,973 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:30:05,973 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:30:05,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:30:05 BoogieIcfgContainer [2019-12-07 18:30:05,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:30:05,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:30:05,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:30:05,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:30:05,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:30:05" (1/3) ... [2019-12-07 18:30:05,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a924c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:30:05, skipping insertion in model container [2019-12-07 18:30:05,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:30:05" (2/3) ... [2019-12-07 18:30:05,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a924c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:30:05, skipping insertion in model container [2019-12-07 18:30:05,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:30:05" (3/3) ... [2019-12-07 18:30:05,979 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-12-07 18:30:05,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:30:05,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:30:05,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:30:05,991 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:30:06,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:30:06,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:30:06,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:30:06,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:30:06,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:30:06,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:30:06,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:30:06,064 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:30:06,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:30:06,076 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-07 18:30:06,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 18:30:06,131 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 18:30:06,132 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:30:06,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:30:06,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-07 18:30:06,177 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-07 18:30:06,177 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:30:06,181 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:30:06,192 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:30:06,192 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:30:08,998 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:30:09,221 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-07 18:30:09,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-07 18:30:09,223 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-07 18:30:09,569 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-07 18:30:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-07 18:30:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:30:09,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:09,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:30:09,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-07 18:30:09,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:09,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856012883] [2019-12-07 18:30:09,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:09,724 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 18:30:09,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856012883] [2019-12-07 18:30:09,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:09,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:30:09,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130408318] [2019-12-07 18:30:09,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:09,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:09,740 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-07 18:30:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:09,932 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-07 18:30:09,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:09,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:30:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:09,994 INFO L225 Difference]: With dead ends: 8598 [2019-12-07 18:30:09,994 INFO L226 Difference]: Without dead ends: 7662 [2019-12-07 18:30:09,995 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 18:30:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-07 18:30:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-07 18:30:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-07 18:30:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-07 18:30:10,258 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-07 18:30:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:10,259 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-07 18:30:10,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-07 18:30:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:30:10,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:10,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:10,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-07 18:30:10,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:10,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288599467] [2019-12-07 18:30:10,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:10,306 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 18:30:10,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288599467] [2019-12-07 18:30:10,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:10,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:30:10,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513526361] [2019-12-07 18:30:10,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:10,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:10,308 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-07 18:30:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:10,330 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-07 18:30:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:10,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 18:30:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:10,339 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 18:30:10,339 INFO L226 Difference]: Without dead ends: 1232 [2019-12-07 18:30:10,340 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 18:30:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-07 18:30:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-07 18:30:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-07 18:30:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-07 18:30:10,368 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-07 18:30:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:10,369 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-07 18:30:10,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-07 18:30:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:30:10,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:10,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:10,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-07 18:30:10,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:10,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896081091] [2019-12-07 18:30:10,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:10,413 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 18:30:10,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896081091] [2019-12-07 18:30:10,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:10,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:30:10,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697725153] [2019-12-07 18:30:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:10,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:10,415 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-07 18:30:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:10,471 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-07 18:30:10,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:10,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 18:30:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:10,501 INFO L225 Difference]: With dead ends: 1943 [2019-12-07 18:30:10,502 INFO L226 Difference]: Without dead ends: 1943 [2019-12-07 18:30:10,502 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 18:30:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-07 18:30:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-07 18:30:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-07 18:30:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-07 18:30:10,534 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-07 18:30:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:10,535 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-07 18:30:10,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-07 18:30:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:30:10,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:10,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:10,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-07 18:30:10,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:10,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811522114] [2019-12-07 18:30:10,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:10,583 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 18:30:10,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811522114] [2019-12-07 18:30:10,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:10,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:30:10,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933717841] [2019-12-07 18:30:10,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:30:10,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:30:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:30:10,585 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-07 18:30:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:10,704 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-07 18:30:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:30:10,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:30:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:10,714 INFO L225 Difference]: With dead ends: 1724 [2019-12-07 18:30:10,714 INFO L226 Difference]: Without dead ends: 1724 [2019-12-07 18:30:10,714 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 18:30:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-07 18:30:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-07 18:30:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-07 18:30:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-07 18:30:10,743 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-07 18:30:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:10,743 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-07 18:30:10,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:30:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-07 18:30:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:30:10,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:10,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:10,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-07 18:30:10,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:10,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676948057] [2019-12-07 18:30:10,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:10,802 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 18:30:10,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676948057] [2019-12-07 18:30:10,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:10,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:30:10,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078892779] [2019-12-07 18:30:10,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:30:10,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:30:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:30:10,803 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-07 18:30:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:10,904 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-07 18:30:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:30:10,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:30:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:10,913 INFO L225 Difference]: With dead ends: 1991 [2019-12-07 18:30:10,913 INFO L226 Difference]: Without dead ends: 1991 [2019-12-07 18:30:10,913 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 18:30:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-07 18:30:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-07 18:30:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-07 18:30:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-07 18:30:10,948 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-07 18:30:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:10,948 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-07 18:30:10,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:30:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-07 18:30:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:30:10,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:10,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:10,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-07 18:30:10,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:10,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919326352] [2019-12-07 18:30:10,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:11,030 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 18:30:11,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919326352] [2019-12-07 18:30:11,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:11,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:30:11,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825757363] [2019-12-07 18:30:11,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:30:11,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:30:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:30:11,032 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-07 18:30:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:11,189 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-07 18:30:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:30:11,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 18:30:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:11,199 INFO L225 Difference]: With dead ends: 2258 [2019-12-07 18:30:11,199 INFO L226 Difference]: Without dead ends: 2258 [2019-12-07 18:30:11,199 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 18:30:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-07 18:30:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-07 18:30:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-07 18:30:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-07 18:30:11,228 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-07 18:30:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:11,228 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-07 18:30:11,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:30:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-07 18:30:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:30:11,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:11,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:11,230 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-07 18:30:11,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:11,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300167144] [2019-12-07 18:30:11,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:11,297 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 18:30:11,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300167144] [2019-12-07 18:30:11,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:11,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:30:11,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893191494] [2019-12-07 18:30:11,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:30:11,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:11,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:30:11,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:30:11,298 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 5 states. [2019-12-07 18:30:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:11,581 INFO L93 Difference]: Finished difference Result 2854 states and 6297 transitions. [2019-12-07 18:30:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:30:11,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:30:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:11,591 INFO L225 Difference]: With dead ends: 2854 [2019-12-07 18:30:11,591 INFO L226 Difference]: Without dead ends: 2854 [2019-12-07 18:30:11,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:30:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-12-07 18:30:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2447. [2019-12-07 18:30:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-07 18:30:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5484 transitions. [2019-12-07 18:30:11,626 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5484 transitions. Word has length 26 [2019-12-07 18:30:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:11,626 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5484 transitions. [2019-12-07 18:30:11,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:30:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5484 transitions. [2019-12-07 18:30:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:30:11,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:11,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:11,629 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-07 18:30:11,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:11,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791069432] [2019-12-07 18:30:11,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:11,700 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 18:30:11,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791069432] [2019-12-07 18:30:11,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:11,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:30:11,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853152938] [2019-12-07 18:30:11,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:30:11,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:30:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:30:11,701 INFO L87 Difference]: Start difference. First operand 2447 states and 5484 transitions. Second operand 5 states. [2019-12-07 18:30:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:11,744 INFO L93 Difference]: Finished difference Result 2571 states and 5724 transitions. [2019-12-07 18:30:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:30:11,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:30:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:11,747 INFO L225 Difference]: With dead ends: 2571 [2019-12-07 18:30:11,747 INFO L226 Difference]: Without dead ends: 2571 [2019-12-07 18:30:11,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:30:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-12-07 18:30:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2571. [2019-12-07 18:30:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-12-07 18:30:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 5724 transitions. [2019-12-07 18:30:11,778 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 5724 transitions. Word has length 26 [2019-12-07 18:30:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:11,778 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 5724 transitions. [2019-12-07 18:30:11,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:30:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 5724 transitions. [2019-12-07 18:30:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:30:11,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:11,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:11,780 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:11,780 INFO L82 PathProgramCache]: Analyzing trace with hash 461323697, now seen corresponding path program 1 times [2019-12-07 18:30:11,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:11,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555510528] [2019-12-07 18:30:11,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:11,812 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 18:30:11,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555510528] [2019-12-07 18:30:11,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:11,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:30:11,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652921181] [2019-12-07 18:30:11,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:11,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:11,813 INFO L87 Difference]: Start difference. First operand 2571 states and 5724 transitions. Second operand 3 states. [2019-12-07 18:30:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:11,824 INFO L93 Difference]: Finished difference Result 2570 states and 5722 transitions. [2019-12-07 18:30:11,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:11,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:30:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:11,827 INFO L225 Difference]: With dead ends: 2570 [2019-12-07 18:30:11,828 INFO L226 Difference]: Without dead ends: 2570 [2019-12-07 18:30:11,828 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 18:30:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-12-07 18:30:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2019-12-07 18:30:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-07 18:30:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-12-07 18:30:11,868 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-12-07 18:30:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:11,868 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-12-07 18:30:11,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-12-07 18:30:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:30:11,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:11,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:11,872 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-07 18:30:11,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:11,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723359277] [2019-12-07 18:30:11,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:11,937 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 18:30:11,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723359277] [2019-12-07 18:30:11,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:11,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:30:11,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81646049] [2019-12-07 18:30:11,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:30:11,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:30:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:30:11,939 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-12-07 18:30:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:12,115 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-12-07 18:30:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:30:12,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:30:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:12,119 INFO L225 Difference]: With dead ends: 3072 [2019-12-07 18:30:12,119 INFO L226 Difference]: Without dead ends: 3072 [2019-12-07 18:30:12,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:30:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-07 18:30:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-12-07 18:30:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-12-07 18:30:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-12-07 18:30:12,153 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-12-07 18:30:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:12,154 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-12-07 18:30:12,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:30:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-12-07 18:30:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:30:12,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:12,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:12,156 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-07 18:30:12,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:12,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706792656] [2019-12-07 18:30:12,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:12,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 18:30:12,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706792656] [2019-12-07 18:30:12,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:30:12,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383687606] [2019-12-07 18:30:12,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:30:12,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:30:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:30:12,189 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 4 states. [2019-12-07 18:30:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:12,202 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-12-07 18:30:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:30:12,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:30:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:12,204 INFO L225 Difference]: With dead ends: 1400 [2019-12-07 18:30:12,205 INFO L226 Difference]: Without dead ends: 1400 [2019-12-07 18:30:12,205 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 18:30:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-07 18:30:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-12-07 18:30:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-12-07 18:30:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-12-07 18:30:12,221 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-12-07 18:30:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-12-07 18:30:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:30:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-12-07 18:30:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:30:12,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:12,223 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] [2019-12-07 18:30:12,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-07 18:30:12,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:12,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073344811] [2019-12-07 18:30:12,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:12,283 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 18:30:12,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073344811] [2019-12-07 18:30:12,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:12,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:30:12,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751333356] [2019-12-07 18:30:12,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:30:12,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:12,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:30:12,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:30:12,285 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 6 states. [2019-12-07 18:30:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:12,664 INFO L93 Difference]: Finished difference Result 1711 states and 3585 transitions. [2019-12-07 18:30:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:30:12,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-07 18:30:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:12,667 INFO L225 Difference]: With dead ends: 1711 [2019-12-07 18:30:12,667 INFO L226 Difference]: Without dead ends: 1711 [2019-12-07 18:30:12,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:30:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-12-07 18:30:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1359. [2019-12-07 18:30:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-12-07 18:30:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2922 transitions. [2019-12-07 18:30:12,686 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2922 transitions. Word has length 50 [2019-12-07 18:30:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:12,686 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2922 transitions. [2019-12-07 18:30:12,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:30:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2922 transitions. [2019-12-07 18:30:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:30:12,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:12,688 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] [2019-12-07 18:30:12,688 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1640582438, now seen corresponding path program 2 times [2019-12-07 18:30:12,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:12,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327330563] [2019-12-07 18:30:12,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:12,730 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 18:30:12,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327330563] [2019-12-07 18:30:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:30:12,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10105456] [2019-12-07 18:30:12,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:12,732 INFO L87 Difference]: Start difference. First operand 1359 states and 2922 transitions. Second operand 3 states. [2019-12-07 18:30:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:12,772 INFO L93 Difference]: Finished difference Result 1646 states and 3485 transitions. [2019-12-07 18:30:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:12,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 18:30:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:12,775 INFO L225 Difference]: With dead ends: 1646 [2019-12-07 18:30:12,776 INFO L226 Difference]: Without dead ends: 1646 [2019-12-07 18:30:12,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-07 18:30:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1369. [2019-12-07 18:30:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-12-07 18:30:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2940 transitions. [2019-12-07 18:30:12,798 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2940 transitions. Word has length 50 [2019-12-07 18:30:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:12,799 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 2940 transitions. [2019-12-07 18:30:12,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2940 transitions. [2019-12-07 18:30:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:30:12,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:12,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:12,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -475366277, now seen corresponding path program 1 times [2019-12-07 18:30:12,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:12,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430900751] [2019-12-07 18:30:12,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:12,850 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 18:30:12,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430900751] [2019-12-07 18:30:12,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:12,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:30:12,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308178936] [2019-12-07 18:30:12,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:30:12,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:30:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:30:12,852 INFO L87 Difference]: Start difference. First operand 1369 states and 2940 transitions. Second operand 3 states. [2019-12-07 18:30:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:12,863 INFO L93 Difference]: Finished difference Result 1368 states and 2938 transitions. [2019-12-07 18:30:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:30:12,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 18:30:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:12,866 INFO L225 Difference]: With dead ends: 1368 [2019-12-07 18:30:12,866 INFO L226 Difference]: Without dead ends: 1368 [2019-12-07 18:30:12,866 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 18:30:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-12-07 18:30:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1106. [2019-12-07 18:30:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-12-07 18:30:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2429 transitions. [2019-12-07 18:30:12,884 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2429 transitions. Word has length 51 [2019-12-07 18:30:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:12,884 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 2429 transitions. [2019-12-07 18:30:12,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:30:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2429 transitions. [2019-12-07 18:30:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:30:12,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:12,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:12,886 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-12-07 18:30:12,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:12,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518837128] [2019-12-07 18:30:12,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:30:12,963 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 18:30:12,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518837128] [2019-12-07 18:30:12,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:30:12,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:30:12,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455675253] [2019-12-07 18:30:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:30:12,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:30:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:30:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:30:12,965 INFO L87 Difference]: Start difference. First operand 1106 states and 2429 transitions. Second operand 7 states. [2019-12-07 18:30:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:30:13,154 INFO L93 Difference]: Finished difference Result 2982 states and 6374 transitions. [2019-12-07 18:30:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:30:13,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 18:30:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:30:13,160 INFO L225 Difference]: With dead ends: 2982 [2019-12-07 18:30:13,160 INFO L226 Difference]: Without dead ends: 2029 [2019-12-07 18:30:13,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:30:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-12-07 18:30:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1164. [2019-12-07 18:30:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-12-07 18:30:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 2553 transitions. [2019-12-07 18:30:13,177 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 2553 transitions. Word has length 52 [2019-12-07 18:30:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:30:13,177 INFO L462 AbstractCegarLoop]: Abstraction has 1164 states and 2553 transitions. [2019-12-07 18:30:13,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:30:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 2553 transitions. [2019-12-07 18:30:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:30:13,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:30:13,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:30:13,179 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:30:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:30:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-12-07 18:30:13,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:30:13,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464585486] [2019-12-07 18:30:13,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:30:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:30:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:30:13,250 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:30:13,250 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:30:13,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:30:13,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:30:13,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-413366092 ~z$w_buff0_used~0_In-413366092) (= |P0Thread1of1ForFork0_#in~arg.base_In-413366092| P0Thread1of1ForFork0_~arg.base_Out-413366092) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-413366092 256))) (not (= (mod ~z$w_buff0_used~0_Out-413366092 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092|) (= P0Thread1of1ForFork0_~arg.offset_Out-413366092 |P0Thread1of1ForFork0_#in~arg.offset_In-413366092|) (= 1 ~z$w_buff0_used~0_Out-413366092) (= ~z$w_buff0~0_Out-413366092 1) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092)) (= ~z$w_buff1~0_Out-413366092 ~z$w_buff0~0_In-413366092) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-413366092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-413366092, ~z$w_buff0~0=~z$w_buff0~0_In-413366092, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-413366092|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-413366092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-413366092, ~z$w_buff0~0=~z$w_buff0~0_Out-413366092, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-413366092, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-413366092|, ~z$w_buff1~0=~z$w_buff1~0_Out-413366092, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-413366092, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-413366092} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:30:13,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In172043326 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out172043326| |P1Thread1of1ForFork1_#t~ite23_Out172043326|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In172043326 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In172043326 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In172043326 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In172043326 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out172043326| ~z$w_buff1_used~0_In172043326)) (and (= |P1Thread1of1ForFork1_#t~ite23_In172043326| |P1Thread1of1ForFork1_#t~ite23_Out172043326|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out172043326| ~z$w_buff1_used~0_In172043326)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In172043326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In172043326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172043326, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In172043326|, ~weak$$choice2~0=~weak$$choice2~0_In172043326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172043326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In172043326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In172043326, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out172043326|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172043326, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out172043326|, ~weak$$choice2~0=~weak$$choice2~0_In172043326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172043326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 18:30:13,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:30:13,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:30:13,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-26470641 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-26470641 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-26470641| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-26470641| ~z$w_buff0_used~0_In-26470641) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-26470641, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26470641} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-26470641|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-26470641, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26470641} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:30:13,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1504897676 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1504897676 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1504897676 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1504897676 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1504897676 |P0Thread1of1ForFork0_#t~ite6_Out1504897676|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1504897676|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1504897676, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1504897676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1504897676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1504897676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1504897676|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1504897676, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1504897676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1504897676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1504897676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:30:13,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out-472365414 ~z$r_buff0_thd1~0_In-472365414)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-472365414 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-472365414 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= ~z$r_buff0_thd1~0_Out-472365414 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-472365414, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-472365414} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-472365414, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-472365414|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-472365414} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:30:13,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2137894398 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2137894398 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-2137894398 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2137894398 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2137894398| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-2137894398| ~z$r_buff1_thd1~0_In-2137894398)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137894398, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2137894398, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137894398, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2137894398} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137894398, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2137894398|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2137894398, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137894398, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2137894398} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:30:13,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-729712184 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-729712184| |P1Thread1of1ForFork1_#t~ite32_Out-729712184|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-729712184 256) 0))) (or (and (= ~z~0_In-729712184 |P1Thread1of1ForFork1_#t~ite32_Out-729712184|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~z$w_buff1~0_In-729712184 |P1Thread1of1ForFork1_#t~ite32_Out-729712184|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-729712184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-729712184, ~z$w_buff1~0=~z$w_buff1~0_In-729712184, ~z~0=~z~0_In-729712184} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-729712184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-729712184, ~z$w_buff1~0=~z$w_buff1~0_In-729712184, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-729712184|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-729712184|, ~z~0=~z~0_In-729712184} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:30:13,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In874057011 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In874057011 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out874057011| ~z$w_buff0_used~0_In874057011) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out874057011| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In874057011, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In874057011} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In874057011, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out874057011|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In874057011} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:30:13,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-935033470 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-935033470 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-935033470 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-935033470 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-935033470| ~z$w_buff1_used~0_In-935033470) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite35_Out-935033470| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-935033470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-935033470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935033470, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-935033470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-935033470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-935033470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935033470, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-935033470|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-935033470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:30:13,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1770008824 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1770008824 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1770008824|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1770008824| ~z$r_buff0_thd2~0_In-1770008824)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770008824, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1770008824} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770008824, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1770008824, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1770008824|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:30:13,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1982468917 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1982468917 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1982468917 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1982468917 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1982468917 |P1Thread1of1ForFork1_#t~ite37_Out-1982468917|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1982468917|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982468917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1982468917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1982468917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1982468917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982468917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1982468917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1982468917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1982468917, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1982468917|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:30:13,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:30:13,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:30:13,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:30:13,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1291890853 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1291890853 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1291890853| ~z~0_In1291890853) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1291890853| ~z$w_buff1~0_In1291890853) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1291890853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1291890853, ~z$w_buff1~0=~z$w_buff1~0_In1291890853, ~z~0=~z~0_In1291890853} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1291890853|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1291890853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1291890853, ~z$w_buff1~0=~z$w_buff1~0_In1291890853, ~z~0=~z~0_In1291890853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:30:13,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 18:30:13,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In657185601 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In657185601 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out657185601| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In657185601 |ULTIMATE.start_main_#t~ite42_Out657185601|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In657185601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In657185601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In657185601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In657185601, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out657185601|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:30:13,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1348433457 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1348433457 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1348433457 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1348433457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1348433457| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1348433457| ~z$w_buff1_used~0_In-1348433457)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1348433457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1348433457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1348433457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348433457} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1348433457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1348433457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1348433457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348433457, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1348433457|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:30:13,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2046942768 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2046942768 256)))) (or (and (= ~z$r_buff0_thd0~0_In-2046942768 |ULTIMATE.start_main_#t~ite44_Out-2046942768|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2046942768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046942768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046942768} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046942768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046942768, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2046942768|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:30:13,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2144985303 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2144985303 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2144985303 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-2144985303 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2144985303| ~z$r_buff1_thd0~0_In-2144985303)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2144985303|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144985303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144985303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144985303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144985303} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144985303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144985303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144985303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144985303, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2144985303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:30:13,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:30:13,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:30:13 BasicIcfg [2019-12-07 18:30:13,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:30:13,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:30:13,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:30:13,304 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:30:13,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:30:05" (3/4) ... [2019-12-07 18:30:13,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:30:13,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 18:30:13,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:30:13,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-413366092 ~z$w_buff0_used~0_In-413366092) (= |P0Thread1of1ForFork0_#in~arg.base_In-413366092| P0Thread1of1ForFork0_~arg.base_Out-413366092) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-413366092 256))) (not (= (mod ~z$w_buff0_used~0_Out-413366092 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092|) (= P0Thread1of1ForFork0_~arg.offset_Out-413366092 |P0Thread1of1ForFork0_#in~arg.offset_In-413366092|) (= 1 ~z$w_buff0_used~0_Out-413366092) (= ~z$w_buff0~0_Out-413366092 1) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092)) (= ~z$w_buff1~0_Out-413366092 ~z$w_buff0~0_In-413366092) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-413366092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-413366092, ~z$w_buff0~0=~z$w_buff0~0_In-413366092, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-413366092|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-413366092|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-413366092, ~z$w_buff0~0=~z$w_buff0~0_Out-413366092, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-413366092, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-413366092, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-413366092|, ~z$w_buff1~0=~z$w_buff1~0_Out-413366092, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-413366092, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-413366092|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-413366092} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:30:13,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In172043326 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out172043326| |P1Thread1of1ForFork1_#t~ite23_Out172043326|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In172043326 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In172043326 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In172043326 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In172043326 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out172043326| ~z$w_buff1_used~0_In172043326)) (and (= |P1Thread1of1ForFork1_#t~ite23_In172043326| |P1Thread1of1ForFork1_#t~ite23_Out172043326|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out172043326| ~z$w_buff1_used~0_In172043326)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In172043326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In172043326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172043326, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In172043326|, ~weak$$choice2~0=~weak$$choice2~0_In172043326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172043326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In172043326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In172043326, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out172043326|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172043326, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out172043326|, ~weak$$choice2~0=~weak$$choice2~0_In172043326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In172043326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 18:30:13,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:30:13,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 18:30:13,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-26470641 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-26470641 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-26470641| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-26470641| ~z$w_buff0_used~0_In-26470641) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-26470641, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26470641} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-26470641|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-26470641, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-26470641} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:30:13,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1504897676 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1504897676 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1504897676 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1504897676 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1504897676 |P0Thread1of1ForFork0_#t~ite6_Out1504897676|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1504897676|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1504897676, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1504897676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1504897676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1504897676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1504897676|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1504897676, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1504897676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1504897676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1504897676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:30:13,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= ~z$r_buff0_thd1~0_Out-472365414 ~z$r_buff0_thd1~0_In-472365414)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-472365414 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-472365414 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= ~z$r_buff0_thd1~0_Out-472365414 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-472365414, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-472365414} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-472365414, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-472365414|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-472365414} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:30:13,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2137894398 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2137894398 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-2137894398 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2137894398 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2137894398| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-2137894398| ~z$r_buff1_thd1~0_In-2137894398)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137894398, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2137894398, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137894398, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2137894398} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137894398, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2137894398|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2137894398, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137894398, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2137894398} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:30:13,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-729712184 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-729712184| |P1Thread1of1ForFork1_#t~ite32_Out-729712184|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-729712184 256) 0))) (or (and (= ~z~0_In-729712184 |P1Thread1of1ForFork1_#t~ite32_Out-729712184|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~z$w_buff1~0_In-729712184 |P1Thread1of1ForFork1_#t~ite32_Out-729712184|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-729712184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-729712184, ~z$w_buff1~0=~z$w_buff1~0_In-729712184, ~z~0=~z~0_In-729712184} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-729712184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-729712184, ~z$w_buff1~0=~z$w_buff1~0_In-729712184, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-729712184|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-729712184|, ~z~0=~z~0_In-729712184} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:30:13,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In874057011 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In874057011 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out874057011| ~z$w_buff0_used~0_In874057011) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out874057011| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In874057011, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In874057011} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In874057011, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out874057011|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In874057011} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:30:13,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-935033470 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-935033470 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-935033470 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-935033470 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-935033470| ~z$w_buff1_used~0_In-935033470) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite35_Out-935033470| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-935033470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-935033470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935033470, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-935033470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-935033470, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-935033470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935033470, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-935033470|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-935033470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:30:13,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1770008824 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1770008824 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1770008824|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1770008824| ~z$r_buff0_thd2~0_In-1770008824)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770008824, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1770008824} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770008824, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1770008824, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1770008824|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1982468917 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1982468917 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1982468917 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1982468917 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1982468917 |P1Thread1of1ForFork1_#t~ite37_Out-1982468917|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1982468917|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982468917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1982468917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1982468917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1982468917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982468917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1982468917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1982468917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1982468917, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1982468917|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1291890853 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1291890853 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1291890853| ~z~0_In1291890853) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1291890853| ~z$w_buff1~0_In1291890853) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1291890853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1291890853, ~z$w_buff1~0=~z$w_buff1~0_In1291890853, ~z~0=~z~0_In1291890853} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1291890853|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1291890853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1291890853, ~z$w_buff1~0=~z$w_buff1~0_In1291890853, ~z~0=~z~0_In1291890853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:30:13,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 18:30:13,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In657185601 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In657185601 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out657185601| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In657185601 |ULTIMATE.start_main_#t~ite42_Out657185601|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In657185601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In657185601} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In657185601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In657185601, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out657185601|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:30:13,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1348433457 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1348433457 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1348433457 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1348433457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-1348433457| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1348433457| ~z$w_buff1_used~0_In-1348433457)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1348433457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1348433457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1348433457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348433457} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1348433457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1348433457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1348433457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1348433457, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1348433457|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:30:13,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2046942768 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2046942768 256)))) (or (and (= ~z$r_buff0_thd0~0_In-2046942768 |ULTIMATE.start_main_#t~ite44_Out-2046942768|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2046942768|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046942768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046942768} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046942768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046942768, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2046942768|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:30:13,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2144985303 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2144985303 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2144985303 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-2144985303 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2144985303| ~z$r_buff1_thd0~0_In-2144985303)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2144985303|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144985303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144985303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144985303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144985303} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144985303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144985303, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144985303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144985303, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2144985303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:30:13,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:30:13,364 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_927d2193-b6c7-45b2-8a09-e7cb8569d0da/bin/uautomizer/witness.graphml [2019-12-07 18:30:13,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:30:13,366 INFO L168 Benchmark]: Toolchain (without parser) took 8220.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 938.0 MB in the beginning and 792.4 MB in the end (delta: 145.6 MB). Peak memory consumption was 364.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:30:13,366 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 18:30:13,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.73 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: -129.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:30:13,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.79 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 18:30:13,367 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 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 18:30:13,367 INFO L168 Benchmark]: RCFGBuilder took 377.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:30:13,367 INFO L168 Benchmark]: TraceAbstraction took 7328.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 818.5 MB in the end (delta: 193.9 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:30:13,368 INFO L168 Benchmark]: Witness Printer took 60.99 ms. Allocated memory is still 1.2 GB. Free memory was 818.5 MB in the beginning and 792.4 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:30:13,369 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 385.73 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: -129.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.79 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. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7328.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 818.5 MB in the end (delta: 193.9 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Witness Printer took 60.99 ms. Allocated memory is still 1.2 GB. Free memory was 818.5 MB in the beginning and 792.4 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1883 SDtfs, 1434 SDslu, 3439 SDs, 0 SdLazy, 1799 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3983 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 58276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...