./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8f8b982d1b6278787b824b8b49b18740fcbdfa1a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-28 17:59:24,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:59:24,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:59:24,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:59:24,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:59:24,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:59:24,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:59:24,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:59:24,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:59:24,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:59:24,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:59:24,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:59:24,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:59:24,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:59:24,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:59:24,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:59:24,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:59:24,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:59:24,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:59:24,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:59:24,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:59:24,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:59:24,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:59:24,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:59:24,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:59:24,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:59:24,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:59:24,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:59:24,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:59:24,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:59:24,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:59:24,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:59:24,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:59:24,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:59:24,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:59:24,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:59:24,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:59:24,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:59:24,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:59:24,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:59:24,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:59:24,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:59:24,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:59:24,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:59:24,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:59:24,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:59:24,890 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:59:24,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:59:24,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:59:24,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:59:24,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:59:24,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:59:24,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:59:24,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:59:24,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:59:24,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:59:24,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:59:24,895 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:59:24,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:59:24,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:59:24,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:59:24,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:59:24,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:59:24,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:59:24,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:59:24,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:59:24,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:59:24,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:59:24,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:59:24,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:59:24,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:59:24,898 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8f8b982d1b6278787b824b8b49b18740fcbdfa1a [2019-11-28 17:59:25,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:59:25,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:59:25,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:59:25,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:59:25,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:59:25,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2019-11-28 17:59:25,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e264b6898/86226263685d45aca202f96e731979a3/FLAGf6116decc [2019-11-28 17:59:25,886 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:59:25,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2019-11-28 17:59:25,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e264b6898/86226263685d45aca202f96e731979a3/FLAGf6116decc [2019-11-28 17:59:26,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e264b6898/86226263685d45aca202f96e731979a3 [2019-11-28 17:59:26,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:59:26,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:59:26,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:59:26,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:59:26,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:59:26,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:26,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26, skipping insertion in model container [2019-11-28 17:59:26,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:26,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:59:26,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:59:26,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:59:26,764 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:59:26,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:59:26,940 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:59:26,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26 WrapperNode [2019-11-28 17:59:26,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:59:26,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:59:26,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:59:26,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:59:26,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:26,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:59:27,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:59:27,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:59:27,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:59:27,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... [2019-11-28 17:59:27,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:59:27,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:59:27,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:59:27,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:59:27,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:59:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:59:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 17:59:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:59:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:59:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 17:59:27,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 17:59:27,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 17:59:27,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 17:59:27,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 17:59:27,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:59:27,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:59:27,157 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 17:59:27,950 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:59:27,951 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 17:59:27,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:59:27 BoogieIcfgContainer [2019-11-28 17:59:27,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:59:27,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:59:27,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:59:27,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:59:27,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:59:26" (1/3) ... [2019-11-28 17:59:27,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d141071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:59:27, skipping insertion in model container [2019-11-28 17:59:27,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:59:26" (2/3) ... [2019-11-28 17:59:27,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d141071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:59:27, skipping insertion in model container [2019-11-28 17:59:27,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:59:27" (3/3) ... [2019-11-28 17:59:27,961 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt.i [2019-11-28 17:59:27,972 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:59:27,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:59:27,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:59:27,981 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:59:28,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,024 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:59:28,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 17:59:28,115 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:59:28,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:59:28,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:59:28,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:59:28,116 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:59:28,116 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:59:28,116 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:59:28,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:59:28,135 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-11-28 17:59:28,138 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 17:59:28,247 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 17:59:28,247 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:59:28,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 17:59:28,315 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 17:59:28,382 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 17:59:28,383 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:59:28,395 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 17:59:28,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-11-28 17:59:28,431 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:59:33,620 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 17:59:33,878 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 17:59:34,018 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 17:59:34,070 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-11-28 17:59:34,070 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-11-28 17:59:34,074 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-11-28 17:59:36,258 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-11-28 17:59:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-11-28 17:59:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 17:59:36,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:36,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 17:59:36,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-11-28 17:59:36,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:36,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225022331] [2019-11-28 17:59:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:36,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225022331] [2019-11-28 17:59:36,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:36,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 17:59:36,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314446802] [2019-11-28 17:59:36,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:59:36,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:59:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:59:36,658 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-11-28 17:59:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:37,282 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-11-28 17:59:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:59:37,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 17:59:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:37,526 INFO L225 Difference]: With dead ends: 23438 [2019-11-28 17:59:37,532 INFO L226 Difference]: Without dead ends: 21828 [2019-11-28 17:59:37,536 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-11-28 17:59:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-11-28 17:59:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-11-28 17:59:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-11-28 17:59:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-11-28 17:59:38,905 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-11-28 17:59:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:38,906 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-11-28 17:59:38,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:59:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-11-28 17:59:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:59:38,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:38,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:38,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-11-28 17:59:38,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:38,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371289590] [2019-11-28 17:59:38,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:39,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371289590] [2019-11-28 17:59:39,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:39,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:59:39,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783408259] [2019-11-28 17:59:39,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:39,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:39,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:39,018 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-11-28 17:59:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:39,782 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-11-28 17:59:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:39,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 17:59:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:39,948 INFO L225 Difference]: With dead ends: 34804 [2019-11-28 17:59:39,948 INFO L226 Difference]: Without dead ends: 34788 [2019-11-28 17:59:39,950 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-11-28 17:59:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-11-28 17:59:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-11-28 17:59:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-11-28 17:59:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-11-28 17:59:41,823 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-11-28 17:59:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:41,824 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-11-28 17:59:41,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-11-28 17:59:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:59:41,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:41,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:41,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-11-28 17:59:41,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:41,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618579375] [2019-11-28 17:59:41,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:41,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618579375] [2019-11-28 17:59:41,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:41,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:59:41,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404756947] [2019-11-28 17:59:41,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:41,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:41,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:41,896 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-11-28 17:59:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:42,378 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-11-28 17:59:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:42,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 17:59:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:42,636 INFO L225 Difference]: With dead ends: 44062 [2019-11-28 17:59:42,637 INFO L226 Difference]: Without dead ends: 44047 [2019-11-28 17:59:42,638 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-11-28 17:59:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-11-28 17:59:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-11-28 17:59:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-11-28 17:59:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-11-28 17:59:44,648 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-11-28 17:59:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:44,649 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-11-28 17:59:44,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-11-28 17:59:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:59:44,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:44,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:44,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-11-28 17:59:44,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:44,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70992600] [2019-11-28 17:59:44,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:44,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-11-28 17:59:44,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70992600] [2019-11-28 17:59:44,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:44,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:59:44,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834442844] [2019-11-28 17:59:44,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:59:44,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:44,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:59:44,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:59:44,702 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-11-28 17:59:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:45,053 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-11-28 17:59:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:59:45,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:59:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:45,222 INFO L225 Difference]: With dead ends: 64200 [2019-11-28 17:59:45,223 INFO L226 Difference]: Without dead ends: 64200 [2019-11-28 17:59:45,223 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-11-28 17:59:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-11-28 17:59:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-11-28 17:59:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-11-28 17:59:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-11-28 17:59:47,457 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-11-28 17:59:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:47,457 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-11-28 17:59:47,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:59:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-11-28 17:59:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:59:47,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:47,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:47,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-11-28 17:59:47,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:47,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102356969] [2019-11-28 17:59:47,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:47,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102356969] [2019-11-28 17:59:47,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:47,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:59:47,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456545362] [2019-11-28 17:59:47,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:47,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:47,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:47,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:47,551 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 4 states. [2019-11-28 17:59:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:47,621 INFO L93 Difference]: Finished difference Result 9360 states and 25413 transitions. [2019-11-28 17:59:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:59:47,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 17:59:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:47,640 INFO L225 Difference]: With dead ends: 9360 [2019-11-28 17:59:47,640 INFO L226 Difference]: Without dead ends: 5784 [2019-11-28 17:59:47,640 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-11-28 17:59:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2019-11-28 17:59:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2019-11-28 17:59:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-11-28 17:59:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 13603 transitions. [2019-11-28 17:59:47,716 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 13603 transitions. Word has length 16 [2019-11-28 17:59:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:47,717 INFO L462 AbstractCegarLoop]: Abstraction has 5784 states and 13603 transitions. [2019-11-28 17:59:47,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 13603 transitions. [2019-11-28 17:59:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:59:47,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:47,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:47,718 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-11-28 17:59:47,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511898450] [2019-11-28 17:59:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:47,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511898450] [2019-11-28 17:59:47,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:47,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:59:47,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484336877] [2019-11-28 17:59:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:47,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:47,786 INFO L87 Difference]: Start difference. First operand 5784 states and 13603 transitions. Second operand 4 states. [2019-11-28 17:59:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:48,049 INFO L93 Difference]: Finished difference Result 7282 states and 16815 transitions. [2019-11-28 17:59:48,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:48,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 17:59:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:48,065 INFO L225 Difference]: With dead ends: 7282 [2019-11-28 17:59:48,066 INFO L226 Difference]: Without dead ends: 7254 [2019-11-28 17:59:48,066 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-11-28 17:59:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-11-28 17:59:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5763. [2019-11-28 17:59:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-11-28 17:59:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 13545 transitions. [2019-11-28 17:59:48,191 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 13545 transitions. Word has length 17 [2019-11-28 17:59:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:48,192 INFO L462 AbstractCegarLoop]: Abstraction has 5763 states and 13545 transitions. [2019-11-28 17:59:48,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 13545 transitions. [2019-11-28 17:59:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:59:48,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:48,201 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-11-28 17:59:48,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1652760743, now seen corresponding path program 1 times [2019-11-28 17:59:48,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:48,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129728338] [2019-11-28 17:59:48,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:48,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129728338] [2019-11-28 17:59:48,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:48,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:59:48,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784575429] [2019-11-28 17:59:48,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:59:48,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:59:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:59:48,357 INFO L87 Difference]: Start difference. First operand 5763 states and 13545 transitions. Second operand 5 states. [2019-11-28 17:59:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:48,759 INFO L93 Difference]: Finished difference Result 7869 states and 17987 transitions. [2019-11-28 17:59:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:59:48,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 17:59:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:48,772 INFO L225 Difference]: With dead ends: 7869 [2019-11-28 17:59:48,773 INFO L226 Difference]: Without dead ends: 7868 [2019-11-28 17:59:48,773 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-11-28 17:59:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-11-28 17:59:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7238. [2019-11-28 17:59:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-11-28 17:59:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 16736 transitions. [2019-11-28 17:59:48,910 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 16736 transitions. Word has length 28 [2019-11-28 17:59:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:48,911 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 16736 transitions. [2019-11-28 17:59:48,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:59:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 16736 transitions. [2019-11-28 17:59:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:59:48,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:48,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:48,921 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-11-28 17:59:48,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:48,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417881613] [2019-11-28 17:59:48,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:48,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417881613] [2019-11-28 17:59:48,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:48,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:59:48,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81568632] [2019-11-28 17:59:48,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:59:48,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:59:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:59:48,974 INFO L87 Difference]: Start difference. First operand 7238 states and 16736 transitions. Second operand 3 states. [2019-11-28 17:59:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:49,065 INFO L93 Difference]: Finished difference Result 7743 states and 16952 transitions. [2019-11-28 17:59:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:59:49,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:59:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:49,079 INFO L225 Difference]: With dead ends: 7743 [2019-11-28 17:59:49,079 INFO L226 Difference]: Without dead ends: 7743 [2019-11-28 17:59:49,080 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-11-28 17:59:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7743 states. [2019-11-28 17:59:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7743 to 7211. [2019-11-28 17:59:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-11-28 17:59:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 15844 transitions. [2019-11-28 17:59:49,171 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 15844 transitions. Word has length 31 [2019-11-28 17:59:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:49,171 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 15844 transitions. [2019-11-28 17:59:49,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:59:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 15844 transitions. [2019-11-28 17:59:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:59:49,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:49,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:49,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash 525279466, now seen corresponding path program 1 times [2019-11-28 17:59:49,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:49,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208879664] [2019-11-28 17:59:49,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:49,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208879664] [2019-11-28 17:59:49,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:49,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:59:49,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624446429] [2019-11-28 17:59:49,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:59:49,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:59:49,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:59:49,303 INFO L87 Difference]: Start difference. First operand 7211 states and 15844 transitions. Second operand 5 states. [2019-11-28 17:59:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:49,364 INFO L93 Difference]: Finished difference Result 4783 states and 10409 transitions. [2019-11-28 17:59:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:49,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 17:59:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:49,815 INFO L225 Difference]: With dead ends: 4783 [2019-11-28 17:59:49,815 INFO L226 Difference]: Without dead ends: 4499 [2019-11-28 17:59:49,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:59:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-11-28 17:59:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3776. [2019-11-28 17:59:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3776 states. [2019-11-28 17:59:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 8425 transitions. [2019-11-28 17:59:49,859 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 8425 transitions. Word has length 33 [2019-11-28 17:59:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:49,859 INFO L462 AbstractCegarLoop]: Abstraction has 3776 states and 8425 transitions. [2019-11-28 17:59:49,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:59:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 8425 transitions. [2019-11-28 17:59:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 17:59:49,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:49,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:49,866 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 304936195, now seen corresponding path program 1 times [2019-11-28 17:59:49,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:49,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751936173] [2019-11-28 17:59:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:49,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751936173] [2019-11-28 17:59:49,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:49,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:59:49,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321700283] [2019-11-28 17:59:49,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:59:49,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:59:49,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:59:49,959 INFO L87 Difference]: Start difference. First operand 3776 states and 8425 transitions. Second operand 3 states. [2019-11-28 17:59:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:49,983 INFO L93 Difference]: Finished difference Result 3776 states and 8424 transitions. [2019-11-28 17:59:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:59:49,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-28 17:59:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:49,989 INFO L225 Difference]: With dead ends: 3776 [2019-11-28 17:59:49,990 INFO L226 Difference]: Without dead ends: 3776 [2019-11-28 17:59:49,990 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-11-28 17:59:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2019-11-28 17:59:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3701. [2019-11-28 17:59:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-11-28 17:59:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 8291 transitions. [2019-11-28 17:59:50,045 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 8291 transitions. Word has length 58 [2019-11-28 17:59:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:50,045 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 8291 transitions. [2019-11-28 17:59:50,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:59:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 8291 transitions. [2019-11-28 17:59:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 17:59:50,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:50,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:50,051 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash 879996346, now seen corresponding path program 1 times [2019-11-28 17:59:50,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:50,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055020793] [2019-11-28 17:59:50,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:50,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055020793] [2019-11-28 17:59:50,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:50,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:59:50,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776852098] [2019-11-28 17:59:50,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:50,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:50,238 INFO L87 Difference]: Start difference. First operand 3701 states and 8291 transitions. Second operand 4 states. [2019-11-28 17:59:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:50,535 INFO L93 Difference]: Finished difference Result 5705 states and 12584 transitions. [2019-11-28 17:59:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:59:50,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-28 17:59:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:50,544 INFO L225 Difference]: With dead ends: 5705 [2019-11-28 17:59:50,545 INFO L226 Difference]: Without dead ends: 5705 [2019-11-28 17:59:50,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2019-11-28 17:59:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 3949. [2019-11-28 17:59:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-11-28 17:59:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 8692 transitions. [2019-11-28 17:59:50,615 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 8692 transitions. Word has length 59 [2019-11-28 17:59:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:50,615 INFO L462 AbstractCegarLoop]: Abstraction has 3949 states and 8692 transitions. [2019-11-28 17:59:50,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 8692 transitions. [2019-11-28 17:59:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 17:59:50,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:50,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:50,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1460301056, now seen corresponding path program 2 times [2019-11-28 17:59:50,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:50,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850452249] [2019-11-28 17:59:50,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:50,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850452249] [2019-11-28 17:59:50,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:50,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:59:50,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566657915] [2019-11-28 17:59:50,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:59:50,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:59:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:59:50,766 INFO L87 Difference]: Start difference. First operand 3949 states and 8692 transitions. Second operand 6 states. [2019-11-28 17:59:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:51,321 INFO L93 Difference]: Finished difference Result 4433 states and 9617 transitions. [2019-11-28 17:59:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:59:51,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-28 17:59:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:51,331 INFO L225 Difference]: With dead ends: 4433 [2019-11-28 17:59:51,331 INFO L226 Difference]: Without dead ends: 4433 [2019-11-28 17:59:51,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:59:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2019-11-28 17:59:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4033. [2019-11-28 17:59:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4033 states. [2019-11-28 17:59:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 8825 transitions. [2019-11-28 17:59:51,413 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 8825 transitions. Word has length 59 [2019-11-28 17:59:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:51,413 INFO L462 AbstractCegarLoop]: Abstraction has 4033 states and 8825 transitions. [2019-11-28 17:59:51,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:59:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 8825 transitions. [2019-11-28 17:59:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 17:59:51,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:51,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:51,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash -135008044, now seen corresponding path program 3 times [2019-11-28 17:59:51,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:51,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612851147] [2019-11-28 17:59:51,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:51,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612851147] [2019-11-28 17:59:51,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:59:51,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550533429] [2019-11-28 17:59:51,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:59:51,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:59:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:59:51,633 INFO L87 Difference]: Start difference. First operand 4033 states and 8825 transitions. Second operand 6 states. [2019-11-28 17:59:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:52,168 INFO L93 Difference]: Finished difference Result 5214 states and 11261 transitions. [2019-11-28 17:59:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:59:52,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-28 17:59:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:52,175 INFO L225 Difference]: With dead ends: 5214 [2019-11-28 17:59:52,175 INFO L226 Difference]: Without dead ends: 5214 [2019-11-28 17:59:52,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:59:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2019-11-28 17:59:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 4172. [2019-11-28 17:59:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4172 states. [2019-11-28 17:59:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 9111 transitions. [2019-11-28 17:59:52,222 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 9111 transitions. Word has length 59 [2019-11-28 17:59:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:52,222 INFO L462 AbstractCegarLoop]: Abstraction has 4172 states and 9111 transitions. [2019-11-28 17:59:52,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:59:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 9111 transitions. [2019-11-28 17:59:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 17:59:52,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:52,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:52,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1862281344, now seen corresponding path program 4 times [2019-11-28 17:59:52,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:52,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080853151] [2019-11-28 17:59:52,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:52,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080853151] [2019-11-28 17:59:52,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:52,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:59:52,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756894780] [2019-11-28 17:59:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:59:52,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:59:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:59:52,298 INFO L87 Difference]: Start difference. First operand 4172 states and 9111 transitions. Second operand 5 states. [2019-11-28 17:59:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:52,553 INFO L93 Difference]: Finished difference Result 4977 states and 10646 transitions. [2019-11-28 17:59:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:59:52,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-28 17:59:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:52,564 INFO L225 Difference]: With dead ends: 4977 [2019-11-28 17:59:52,564 INFO L226 Difference]: Without dead ends: 4977 [2019-11-28 17:59:52,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:59:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4977 states. [2019-11-28 17:59:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4977 to 4284. [2019-11-28 17:59:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4284 states. [2019-11-28 17:59:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 9339 transitions. [2019-11-28 17:59:52,613 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 9339 transitions. Word has length 59 [2019-11-28 17:59:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:52,613 INFO L462 AbstractCegarLoop]: Abstraction has 4284 states and 9339 transitions. [2019-11-28 17:59:52,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:59:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 9339 transitions. [2019-11-28 17:59:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:52,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:52,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:52,620 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:52,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1624910636, now seen corresponding path program 1 times [2019-11-28 17:59:52,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:52,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283697347] [2019-11-28 17:59:52,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:52,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283697347] [2019-11-28 17:59:52,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:52,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:59:52,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498021863] [2019-11-28 17:59:52,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:59:52,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:52,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:59:52,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:59:52,758 INFO L87 Difference]: Start difference. First operand 4284 states and 9339 transitions. Second operand 4 states. [2019-11-28 17:59:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:52,811 INFO L93 Difference]: Finished difference Result 4741 states and 10306 transitions. [2019-11-28 17:59:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:52,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-28 17:59:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:52,818 INFO L225 Difference]: With dead ends: 4741 [2019-11-28 17:59:52,818 INFO L226 Difference]: Without dead ends: 4217 [2019-11-28 17:59:52,820 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-11-28 17:59:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2019-11-28 17:59:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3810. [2019-11-28 17:59:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3810 states. [2019-11-28 17:59:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 8268 transitions. [2019-11-28 17:59:52,885 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 8268 transitions. Word has length 60 [2019-11-28 17:59:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:52,886 INFO L462 AbstractCegarLoop]: Abstraction has 3810 states and 8268 transitions. [2019-11-28 17:59:52,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:59:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 8268 transitions. [2019-11-28 17:59:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:52,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:52,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:52,894 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1820737366, now seen corresponding path program 2 times [2019-11-28 17:59:52,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938478002] [2019-11-28 17:59:52,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:53,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938478002] [2019-11-28 17:59:53,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:53,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:59:53,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746758114] [2019-11-28 17:59:53,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:59:53,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:53,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:59:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:59:53,037 INFO L87 Difference]: Start difference. First operand 3810 states and 8268 transitions. Second operand 6 states. [2019-11-28 17:59:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:53,178 INFO L93 Difference]: Finished difference Result 5841 states and 12660 transitions. [2019-11-28 17:59:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:59:53,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-28 17:59:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:53,185 INFO L225 Difference]: With dead ends: 5841 [2019-11-28 17:59:53,185 INFO L226 Difference]: Without dead ends: 4636 [2019-11-28 17:59:53,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:59:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2019-11-28 17:59:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 3843. [2019-11-28 17:59:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2019-11-28 17:59:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 8305 transitions. [2019-11-28 17:59:53,252 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 8305 transitions. Word has length 60 [2019-11-28 17:59:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:53,253 INFO L462 AbstractCegarLoop]: Abstraction has 3843 states and 8305 transitions. [2019-11-28 17:59:53,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:59:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 8305 transitions. [2019-11-28 17:59:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:53,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:53,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:53,262 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1919849814, now seen corresponding path program 3 times [2019-11-28 17:59:53,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:53,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533674020] [2019-11-28 17:59:53,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:53,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533674020] [2019-11-28 17:59:53,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:53,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:59:53,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022218343] [2019-11-28 17:59:53,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:59:53,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:59:53,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:59:53,368 INFO L87 Difference]: Start difference. First operand 3843 states and 8305 transitions. Second operand 8 states. [2019-11-28 17:59:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:53,735 INFO L93 Difference]: Finished difference Result 6844 states and 14761 transitions. [2019-11-28 17:59:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:59:53,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 17:59:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:53,744 INFO L225 Difference]: With dead ends: 6844 [2019-11-28 17:59:53,745 INFO L226 Difference]: Without dead ends: 6302 [2019-11-28 17:59:53,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:59:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2019-11-28 17:59:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 5218. [2019-11-28 17:59:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-11-28 17:59:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 11435 transitions. [2019-11-28 17:59:53,814 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 11435 transitions. Word has length 60 [2019-11-28 17:59:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:53,814 INFO L462 AbstractCegarLoop]: Abstraction has 5218 states and 11435 transitions. [2019-11-28 17:59:53,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:59:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 11435 transitions. [2019-11-28 17:59:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:53,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:53,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:53,821 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1432451734, now seen corresponding path program 4 times [2019-11-28 17:59:53,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:53,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361467976] [2019-11-28 17:59:53,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:53,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361467976] [2019-11-28 17:59:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:53,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:59:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826318861] [2019-11-28 17:59:53,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:59:53,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:59:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:59:53,926 INFO L87 Difference]: Start difference. First operand 5218 states and 11435 transitions. Second operand 5 states. [2019-11-28 17:59:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:53,965 INFO L93 Difference]: Finished difference Result 5743 states and 12558 transitions. [2019-11-28 17:59:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:59:53,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-28 17:59:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:53,968 INFO L225 Difference]: With dead ends: 5743 [2019-11-28 17:59:53,968 INFO L226 Difference]: Without dead ends: 585 [2019-11-28 17:59:53,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:59:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-11-28 17:59:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-11-28 17:59:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-28 17:59:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1201 transitions. [2019-11-28 17:59:53,977 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1201 transitions. Word has length 60 [2019-11-28 17:59:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:53,978 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 1201 transitions. [2019-11-28 17:59:53,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:59:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1201 transitions. [2019-11-28 17:59:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:53,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:53,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:53,980 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1561092922, now seen corresponding path program 5 times [2019-11-28 17:59:53,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:53,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136104895] [2019-11-28 17:59:53,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:59:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:59:54,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136104895] [2019-11-28 17:59:54,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:59:54,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 17:59:54,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629128236] [2019-11-28 17:59:54,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:59:54,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:59:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:59:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:59:54,223 INFO L87 Difference]: Start difference. First operand 585 states and 1201 transitions. Second operand 12 states. [2019-11-28 17:59:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:59:55,130 INFO L93 Difference]: Finished difference Result 1090 states and 2188 transitions. [2019-11-28 17:59:55,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:59:55,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-11-28 17:59:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:59:55,132 INFO L225 Difference]: With dead ends: 1090 [2019-11-28 17:59:55,132 INFO L226 Difference]: Without dead ends: 783 [2019-11-28 17:59:55,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:59:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-11-28 17:59:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 601. [2019-11-28 17:59:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-11-28 17:59:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1231 transitions. [2019-11-28 17:59:55,139 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1231 transitions. Word has length 60 [2019-11-28 17:59:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:59:55,140 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1231 transitions. [2019-11-28 17:59:55,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:59:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1231 transitions. [2019-11-28 17:59:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 17:59:55,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:59:55,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:59:55,141 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:59:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:59:55,141 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 6 times [2019-11-28 17:59:55,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:59:55,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644587698] [2019-11-28 17:59:55,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:59:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:59:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:59:55,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:59:55,262 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:59:55,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34|) |v_ULTIMATE.start_main_~#t12~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t12~0.offset_24| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t12~0.base_34| 4) |v_#length_19|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t12~0.base_34|) (= v_~x$r_buff0_thd1~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34|) 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_18|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, ULTIMATE.start_main_~#t12~0.offset=|v_ULTIMATE.start_main_~#t12~0.offset_24|, #length=|v_#length_19|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t12~0.base=|v_ULTIMATE.start_main_~#t12~0.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t12~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t12~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 17:59:55,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t13~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t13~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t13~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12|) 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12|) |v_ULTIMATE.start_main_~#t13~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t13~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_10|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base] because there is no mapped edge [2019-11-28 17:59:55,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 17:59:55,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1024378602 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1024378602 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1024378602| ~x$w_buff1~0_In1024378602)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1024378602| ~x$w_buff0~0_In1024378602) (not .cse1) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1024378602, ~x$w_buff1~0=~x$w_buff1~0_In1024378602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1024378602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1024378602} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1024378602, ~x$w_buff1~0=~x$w_buff1~0_In1024378602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1024378602, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1024378602|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1024378602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 17:59:55,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 17:59:55,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 17:59:55,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1207675642 256) 0))) (or (and .cse0 (= ~x~0_In-1207675642 |P1Thread1of1ForFork1_#t~ite48_Out-1207675642|)) (and (not .cse0) (= ~x$mem_tmp~0_In-1207675642 |P1Thread1of1ForFork1_#t~ite48_Out-1207675642|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1207675642, ~x$mem_tmp~0=~x$mem_tmp~0_In-1207675642, ~x~0=~x~0_In-1207675642} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1207675642, ~x$mem_tmp~0=~x$mem_tmp~0_In-1207675642, ~x~0=~x~0_In-1207675642, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1207675642|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 17:59:55,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-350889808 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-350889808 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-350889808| ~x$w_buff0_used~0_In-350889808) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-350889808| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350889808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350889808} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-350889808|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350889808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350889808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 17:59:55,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In439036262 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In439036262 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In439036262 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In439036262 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out439036262| ~x$w_buff1_used~0_In439036262) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out439036262| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In439036262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In439036262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In439036262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439036262} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out439036262|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439036262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In439036262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In439036262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439036262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 17:59:55,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In293178994 256))) (.cse2 (= ~x$r_buff0_thd2~0_In293178994 ~x$r_buff0_thd2~0_Out293178994)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In293178994 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out293178994 0)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In293178994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In293178994} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out293178994|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out293178994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In293178994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 17:59:55,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In39571752 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In39571752 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In39571752 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In39571752 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out39571752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite54_Out39571752| ~x$r_buff1_thd2~0_In39571752) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In39571752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In39571752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In39571752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39571752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In39571752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In39571752, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out39571752|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In39571752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39571752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 17:59:55,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 17:59:55,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1673659248 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1673659248| ~x$mem_tmp~0_In-1673659248) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1673659248| ~x~0_In-1673659248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1673659248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1673659248, ~x~0=~x~0_In-1673659248} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1673659248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1673659248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1673659248, ~x~0=~x~0_In-1673659248} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 17:59:55,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 17:59:55,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 17:59:55,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In65698522 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In65698522 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out65698522| |ULTIMATE.start_main_#t~ite57_Out65698522|))) (or (and (= ~x~0_In65698522 |ULTIMATE.start_main_#t~ite57_Out65698522|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite57_Out65698522| ~x$w_buff1~0_In65698522) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In65698522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65698522, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65698522, ~x~0=~x~0_In65698522} OutVars{~x$w_buff1~0=~x$w_buff1~0_In65698522, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out65698522|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out65698522|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65698522, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65698522, ~x~0=~x~0_In65698522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 17:59:55,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1995348711 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1995348711 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1995348711| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1995348711| ~x$w_buff0_used~0_In-1995348711) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995348711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995348711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995348711, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1995348711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995348711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 17:59:55,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In371088329 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In371088329 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In371088329 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In371088329 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out371088329| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite60_Out371088329| ~x$w_buff1_used~0_In371088329) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371088329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371088329, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371088329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371088329} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371088329, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out371088329|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371088329, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371088329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371088329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 17:59:55,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1887310838 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1887310838 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1887310838| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1887310838| ~x$r_buff0_thd0~0_In-1887310838)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887310838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887310838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887310838, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1887310838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887310838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 17:59:55,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2017072545 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2017072545 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2017072545 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2017072545 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-2017072545|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-2017072545| ~x$r_buff1_thd0~0_In-2017072545)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2017072545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2017072545, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2017072545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017072545} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2017072545|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2017072545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2017072545, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2017072545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017072545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 17:59:55,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 17:59:55,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:59:55 BasicIcfg [2019-11-28 17:59:55,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:59:55,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:59:55,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:59:55,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:59:55,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:59:27" (3/4) ... [2019-11-28 17:59:55,434 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:59:55,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34|) |v_ULTIMATE.start_main_~#t12~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t12~0.offset_24| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t12~0.base_34| 4) |v_#length_19|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t12~0.base_34|) (= v_~x$r_buff0_thd1~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34|) 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_18|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, ULTIMATE.start_main_~#t12~0.offset=|v_ULTIMATE.start_main_~#t12~0.offset_24|, #length=|v_#length_19|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t12~0.base=|v_ULTIMATE.start_main_~#t12~0.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t12~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t12~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 17:59:55,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t13~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t13~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t13~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12|) 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12|) |v_ULTIMATE.start_main_~#t13~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t13~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_10|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base] because there is no mapped edge [2019-11-28 17:59:55,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 17:59:55,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1024378602 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1024378602 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1024378602| ~x$w_buff1~0_In1024378602)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1024378602| ~x$w_buff0~0_In1024378602) (not .cse1) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1024378602, ~x$w_buff1~0=~x$w_buff1~0_In1024378602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1024378602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1024378602} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1024378602, ~x$w_buff1~0=~x$w_buff1~0_In1024378602, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1024378602, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1024378602|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1024378602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 17:59:55,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 17:59:55,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 17:59:55,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1207675642 256) 0))) (or (and .cse0 (= ~x~0_In-1207675642 |P1Thread1of1ForFork1_#t~ite48_Out-1207675642|)) (and (not .cse0) (= ~x$mem_tmp~0_In-1207675642 |P1Thread1of1ForFork1_#t~ite48_Out-1207675642|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1207675642, ~x$mem_tmp~0=~x$mem_tmp~0_In-1207675642, ~x~0=~x~0_In-1207675642} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1207675642, ~x$mem_tmp~0=~x$mem_tmp~0_In-1207675642, ~x~0=~x~0_In-1207675642, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1207675642|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 17:59:55,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-350889808 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-350889808 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-350889808| ~x$w_buff0_used~0_In-350889808) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-350889808| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350889808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350889808} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-350889808|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-350889808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-350889808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 17:59:55,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In439036262 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In439036262 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In439036262 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In439036262 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out439036262| ~x$w_buff1_used~0_In439036262) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out439036262| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In439036262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In439036262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In439036262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439036262} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out439036262|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439036262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In439036262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In439036262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439036262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 17:59:55,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In293178994 256))) (.cse2 (= ~x$r_buff0_thd2~0_In293178994 ~x$r_buff0_thd2~0_Out293178994)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In293178994 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out293178994 0)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In293178994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In293178994} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out293178994|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out293178994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In293178994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 17:59:55,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In39571752 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In39571752 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In39571752 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In39571752 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out39571752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite54_Out39571752| ~x$r_buff1_thd2~0_In39571752) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In39571752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In39571752, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In39571752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39571752} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In39571752, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In39571752, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out39571752|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In39571752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39571752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 17:59:55,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 17:59:55,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1673659248 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1673659248| ~x$mem_tmp~0_In-1673659248) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1673659248| ~x~0_In-1673659248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1673659248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1673659248, ~x~0=~x~0_In-1673659248} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1673659248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1673659248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1673659248, ~x~0=~x~0_In-1673659248} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 17:59:55,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 17:59:55,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 17:59:55,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In65698522 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In65698522 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out65698522| |ULTIMATE.start_main_#t~ite57_Out65698522|))) (or (and (= ~x~0_In65698522 |ULTIMATE.start_main_#t~ite57_Out65698522|) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite57_Out65698522| ~x$w_buff1~0_In65698522) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In65698522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65698522, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65698522, ~x~0=~x~0_In65698522} OutVars{~x$w_buff1~0=~x$w_buff1~0_In65698522, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out65698522|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out65698522|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In65698522, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In65698522, ~x~0=~x~0_In65698522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 17:59:55,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1995348711 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1995348711 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1995348711| 0)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1995348711| ~x$w_buff0_used~0_In-1995348711) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995348711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995348711} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995348711, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1995348711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995348711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 17:59:55,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In371088329 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In371088329 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In371088329 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In371088329 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out371088329| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite60_Out371088329| ~x$w_buff1_used~0_In371088329) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371088329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371088329, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371088329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371088329} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In371088329, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out371088329|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371088329, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In371088329, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371088329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 17:59:55,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1887310838 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1887310838 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1887310838| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1887310838| ~x$r_buff0_thd0~0_In-1887310838)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887310838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887310838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1887310838, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1887310838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1887310838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 17:59:55,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2017072545 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2017072545 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2017072545 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2017072545 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-2017072545|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-2017072545| ~x$r_buff1_thd0~0_In-2017072545)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2017072545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2017072545, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2017072545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017072545} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2017072545|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2017072545, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2017072545, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2017072545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017072545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 17:59:55,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 17:59:55,587 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:59:55,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:59:55,589 INFO L168 Benchmark]: Toolchain (without parser) took 29448.65 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 952.3 MB in the beginning and 670.1 MB in the end (delta: 282.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,590 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:59:55,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,591 INFO L168 Benchmark]: Boogie Preprocessor took 56.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:59:55,592 INFO L168 Benchmark]: RCFGBuilder took 877.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,592 INFO L168 Benchmark]: TraceAbstraction took 27476.25 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 697.2 MB in the end (delta: 333.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,593 INFO L168 Benchmark]: Witness Printer took 157.01 ms. Allocated memory is still 2.5 GB. Free memory was 697.2 MB in the beginning and 670.1 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:59:55,596 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.83 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 798.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 877.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27476.25 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 697.2 MB in the end (delta: 333.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 157.01 ms. Allocated memory is still 2.5 GB. Free memory was 697.2 MB in the beginning and 670.1 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t12, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t13, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3843 SDtfs, 4138 SDslu, 7104 SDs, 0 SdLazy, 3160 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57180occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 22477 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 162673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...