./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe022_power.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/safe022_power.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 d6d1b0f8d97c0ebf25f5e99293c7fed6b2817ad3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:30:36,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:30:36,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:30:36,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:30:36,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:30:36,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:30:36,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:30:36,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:30:36,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:30:36,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:30:36,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:30:36,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:30:36,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:30:36,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:30:36,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:30:36,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:30:36,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:30:36,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:30:36,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:30:36,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:30:36,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:30:36,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:30:36,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:30:36,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:30:36,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:30:36,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:30:36,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:30:36,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:30:36,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:30:36,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:30:36,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:30:36,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:30:36,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:30:36,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:30:36,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:30:36,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:30:36,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:30:36,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:30:36,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:30:36,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:30:36,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:30:36,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:30:36,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:30:36,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:30:36,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:30:36,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:30:36,923 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:30:36,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:30:36,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:30:36,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:30:36,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:30:36,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:30:36,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:30:36,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:30:36,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:30:36,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:30:36,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:30:36,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:30:36,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:30:36,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:30:36,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:30:36,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:30:36,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:30:36,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:30:36,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:30:36,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:30:36,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:30:36,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:30:36,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:30:36,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:30:36,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:30:36,930 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 -> d6d1b0f8d97c0ebf25f5e99293c7fed6b2817ad3 [2019-11-28 18:30:37,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:30:37,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:30:37,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:30:37,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:30:37,242 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:30:37,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe022_power.opt.i [2019-11-28 18:30:37,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07721d59d/8488a423acb941b99bd9f0384113ab78/FLAG23e7234c7 [2019-11-28 18:30:37,824 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:30:37,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe022_power.opt.i [2019-11-28 18:30:37,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07721d59d/8488a423acb941b99bd9f0384113ab78/FLAG23e7234c7 [2019-11-28 18:30:38,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07721d59d/8488a423acb941b99bd9f0384113ab78 [2019-11-28 18:30:38,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:30:38,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:30:38,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:38,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:30:38,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:30:38,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38, skipping insertion in model container [2019-11-28 18:30:38,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:30:38,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:30:38,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:38,740 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:30:38,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:38,882 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:30:38,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38 WrapperNode [2019-11-28 18:30:38,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:38,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:38,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:30:38,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:30:38,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:38,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:30:38,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:30:38,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:30:38,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (1/1) ... [2019-11-28 18:30:38,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:30:38,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:30:38,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:30:38,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:30:38,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (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 18:30:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:30:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:30:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:30:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:30:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:30:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:30:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:30:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:30:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:30:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:30:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:30:39,046 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 18:30:39,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:30:39,732 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:30:39,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:39 BoogieIcfgContainer [2019-11-28 18:30:39,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:30:39,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:30:39,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:30:39,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:30:39,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:30:38" (1/3) ... [2019-11-28 18:30:39,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ff2d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:39, skipping insertion in model container [2019-11-28 18:30:39,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:38" (2/3) ... [2019-11-28 18:30:39,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ff2d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:39, skipping insertion in model container [2019-11-28 18:30:39,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:39" (3/3) ... [2019-11-28 18:30:39,746 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.opt.i [2019-11-28 18:30:39,756 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:30:39,757 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:30:39,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:30:39,769 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:30:39,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:39,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:30:39,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:30:39,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:30:39,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:30:39,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:30:39,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:30:39,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:30:39,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:30:39,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:30:39,910 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:30:39,912 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:39,993 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:39,993 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:40,011 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:40,037 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:40,081 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:40,081 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:40,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:40,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:30:40,107 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:30:44,316 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:30:44,430 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:30:44,535 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:30:44,535 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:30:44,539 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:30:45,052 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:30:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:30:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:30:45,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:45,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:30:45,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:30:45,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:45,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539055530] [2019-11-28 18:30:45,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:45,372 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 18:30:45,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539055530] [2019-11-28 18:30:45,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:45,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:30:45,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249636442] [2019-11-28 18:30:45,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:45,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:45,413 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:30:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:45,789 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:30:45,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:45,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:30:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:45,896 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:30:45,904 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:30:45,908 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 18:30:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:30:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:30:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:30:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:30:46,333 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:30:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:46,333 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:30:46,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:30:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:30:46,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:46,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:46,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:30:46,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:46,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938133085] [2019-11-28 18:30:46,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:46,493 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 18:30:46,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938133085] [2019-11-28 18:30:46,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:46,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:46,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137686236] [2019-11-28 18:30:46,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:46,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:46,496 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:30:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:46,958 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:30:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:46,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:30:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:47,045 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:30:47,046 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:30:47,047 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 18:30:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:30:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:30:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:30:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:30:47,709 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:30:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:47,711 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:30:47,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:30:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:30:47,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:47,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:47,720 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:30:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346695294] [2019-11-28 18:30:47,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:47,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346695294] [2019-11-28 18:30:47,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:47,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:47,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357996074] [2019-11-28 18:30:47,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:47,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:47,828 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:30:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:48,137 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:30:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:30:48,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:30:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:48,187 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:30:48,187 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:30:48,188 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 18:30:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:30:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:30:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:30:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:30:48,612 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:30:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:48,613 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:30:48,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:30:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:30:48,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:48,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:48,619 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:30:48,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:48,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678839845] [2019-11-28 18:30:48,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:48,725 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 18:30:48,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678839845] [2019-11-28 18:30:48,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:48,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:48,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205159958] [2019-11-28 18:30:48,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:48,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:48,729 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:30:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:48,790 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-11-28 18:30:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:48,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:30:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:48,840 INFO L225 Difference]: With dead ends: 10750 [2019-11-28 18:30:48,840 INFO L226 Difference]: Without dead ends: 10750 [2019-11-28 18:30:48,841 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 18:30:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-11-28 18:30:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-11-28 18:30:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-11-28 18:30:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-11-28 18:30:49,155 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-11-28 18:30:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:49,155 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-11-28 18:30:49,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-11-28 18:30:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:30:49,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:49,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:49,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-11-28 18:30:49,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:49,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290471350] [2019-11-28 18:30:49,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:49,214 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 18:30:49,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290471350] [2019-11-28 18:30:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:30:49,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480639488] [2019-11-28 18:30:49,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:49,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:49,216 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 3 states. [2019-11-28 18:30:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:49,269 INFO L93 Difference]: Finished difference Result 10710 states and 33130 transitions. [2019-11-28 18:30:49,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:49,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:30:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:49,323 INFO L225 Difference]: With dead ends: 10710 [2019-11-28 18:30:49,323 INFO L226 Difference]: Without dead ends: 10710 [2019-11-28 18:30:49,324 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 18:30:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2019-11-28 18:30:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10645. [2019-11-28 18:30:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10645 states. [2019-11-28 18:30:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 33030 transitions. [2019-11-28 18:30:49,765 INFO L78 Accepts]: Start accepts. Automaton has 10645 states and 33030 transitions. Word has length 16 [2019-11-28 18:30:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:49,765 INFO L462 AbstractCegarLoop]: Abstraction has 10645 states and 33030 transitions. [2019-11-28 18:30:49,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10645 states and 33030 transitions. [2019-11-28 18:30:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:30:49,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:49,770 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 18:30:49,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -680515989, now seen corresponding path program 1 times [2019-11-28 18:30:49,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:49,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986617452] [2019-11-28 18:30:49,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:49,828 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 18:30:49,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986617452] [2019-11-28 18:30:49,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:49,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209084932] [2019-11-28 18:30:49,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:49,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:49,831 INFO L87 Difference]: Start difference. First operand 10645 states and 33030 transitions. Second operand 4 states. [2019-11-28 18:30:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:49,918 INFO L93 Difference]: Finished difference Result 15274 states and 47713 transitions. [2019-11-28 18:30:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:49,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:30:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:49,954 INFO L225 Difference]: With dead ends: 15274 [2019-11-28 18:30:49,954 INFO L226 Difference]: Without dead ends: 15274 [2019-11-28 18:30:49,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:30:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-11-28 18:30:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15237. [2019-11-28 18:30:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15237 states. [2019-11-28 18:30:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 47658 transitions. [2019-11-28 18:30:50,335 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 47658 transitions. Word has length 17 [2019-11-28 18:30:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:50,336 INFO L462 AbstractCegarLoop]: Abstraction has 15237 states and 47658 transitions. [2019-11-28 18:30:50,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 47658 transitions. [2019-11-28 18:30:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:30:50,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:50,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:50,346 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-11-28 18:30:50,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:50,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088501991] [2019-11-28 18:30:50,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:50,426 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 18:30:50,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088501991] [2019-11-28 18:30:50,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:50,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:50,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528248604] [2019-11-28 18:30:50,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:50,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:50,429 INFO L87 Difference]: Start difference. First operand 15237 states and 47658 transitions. Second operand 4 states. [2019-11-28 18:30:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:50,466 INFO L93 Difference]: Finished difference Result 2805 states and 7141 transitions. [2019-11-28 18:30:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:30:50,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:30:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:50,470 INFO L225 Difference]: With dead ends: 2805 [2019-11-28 18:30:50,470 INFO L226 Difference]: Without dead ends: 1955 [2019-11-28 18:30:50,471 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 18:30:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-11-28 18:30:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2019-11-28 18:30:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2019-11-28 18:30:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4404 transitions. [2019-11-28 18:30:50,504 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4404 transitions. Word has length 19 [2019-11-28 18:30:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:50,504 INFO L462 AbstractCegarLoop]: Abstraction has 1955 states and 4404 transitions. [2019-11-28 18:30:50,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4404 transitions. [2019-11-28 18:30:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:30:50,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:50,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:50,508 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:30:50,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:50,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957697580] [2019-11-28 18:30:50,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:50,623 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 18:30:50,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957697580] [2019-11-28 18:30:50,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:50,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:50,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568242692] [2019-11-28 18:30:50,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:30:50,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:50,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:30:50,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:50,625 INFO L87 Difference]: Start difference. First operand 1955 states and 4404 transitions. Second operand 6 states. [2019-11-28 18:30:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,053 INFO L93 Difference]: Finished difference Result 2745 states and 5950 transitions. [2019-11-28 18:30:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:51,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:30:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,059 INFO L225 Difference]: With dead ends: 2745 [2019-11-28 18:30:51,059 INFO L226 Difference]: Without dead ends: 2693 [2019-11-28 18:30:51,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:30:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2019-11-28 18:30:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1926. [2019-11-28 18:30:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-11-28 18:30:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4340 transitions. [2019-11-28 18:30:51,092 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4340 transitions. Word has length 24 [2019-11-28 18:30:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,092 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 4340 transitions. [2019-11-28 18:30:51,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:30:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4340 transitions. [2019-11-28 18:30:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:30:51,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,096 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 18:30:51,096 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-11-28 18:30:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152560725] [2019-11-28 18:30:51,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:51,161 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 18:30:51,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152560725] [2019-11-28 18:30:51,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:51,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:51,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708893024] [2019-11-28 18:30:51,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:51,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:51,164 INFO L87 Difference]: Start difference. First operand 1926 states and 4340 transitions. Second operand 5 states. [2019-11-28 18:30:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,221 INFO L93 Difference]: Finished difference Result 1028 states and 2299 transitions. [2019-11-28 18:30:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:51,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:30:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,225 INFO L225 Difference]: With dead ends: 1028 [2019-11-28 18:30:51,225 INFO L226 Difference]: Without dead ends: 942 [2019-11-28 18:30:51,226 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 18:30:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-11-28 18:30:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 689. [2019-11-28 18:30:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-28 18:30:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-11-28 18:30:51,244 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 28 [2019-11-28 18:30:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,244 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-11-28 18:30:51,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-11-28 18:30:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:51,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:51,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-11-28 18:30:51,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862762686] [2019-11-28 18:30:51,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:51,377 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 18:30:51,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862762686] [2019-11-28 18:30:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:30:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266316364] [2019-11-28 18:30:51,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:51,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:51,381 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-11-28 18:30:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,729 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-11-28 18:30:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:30:51,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:30:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,732 INFO L225 Difference]: With dead ends: 1105 [2019-11-28 18:30:51,732 INFO L226 Difference]: Without dead ends: 1105 [2019-11-28 18:30:51,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-28 18:30:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-11-28 18:30:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-28 18:30:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-11-28 18:30:51,748 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-11-28 18:30:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,748 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-11-28 18:30:51,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-11-28 18:30:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:51,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:51,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-11-28 18:30:51,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191915681] [2019-11-28 18:30:51,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:51,819 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 18:30:51,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191915681] [2019-11-28 18:30:51,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:51,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:51,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041481126] [2019-11-28 18:30:51,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:51,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:51,823 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-11-28 18:30:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,890 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-11-28 18:30:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:51,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:30:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,892 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:30:51,892 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:30:51,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:30:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:30:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-11-28 18:30:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:30:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:30:51,916 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:30:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,916 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:30:51,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:30:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:51,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:51,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:30:51,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782563983] [2019-11-28 18:30:51,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:52,238 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 18:30:52,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782563983] [2019-11-28 18:30:52,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:52,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:30:52,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136591772] [2019-11-28 18:30:52,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:30:52,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:52,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:30:52,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:30:52,244 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 11 states. [2019-11-28 18:30:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:52,971 INFO L93 Difference]: Finished difference Result 2426 states and 5230 transitions. [2019-11-28 18:30:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:52,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-28 18:30:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:52,974 INFO L225 Difference]: With dead ends: 2426 [2019-11-28 18:30:52,974 INFO L226 Difference]: Without dead ends: 759 [2019-11-28 18:30:52,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:30:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-28 18:30:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-28 18:30:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-28 18:30:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-11-28 18:30:52,986 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-11-28 18:30:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:52,986 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-11-28 18:30:52,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:30:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-11-28 18:30:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:52,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:52,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:52,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-11-28 18:30:52,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:52,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753278892] [2019-11-28 18:30:52,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:53,401 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 18:30:53,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753278892] [2019-11-28 18:30:53,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:53,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:30:53,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71209563] [2019-11-28 18:30:53,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:30:53,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:53,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:30:53,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:30:53,406 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-11-28 18:30:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:54,627 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-11-28 18:30:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:30:54,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:30:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:54,629 INFO L225 Difference]: With dead ends: 1086 [2019-11-28 18:30:54,629 INFO L226 Difference]: Without dead ends: 865 [2019-11-28 18:30:54,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-28 18:30:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-28 18:30:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-11-28 18:30:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 18:30:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-11-28 18:30:54,648 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-11-28 18:30:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:54,649 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-11-28 18:30:54,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:30:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-11-28 18:30:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:54,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:54,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:54,654 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-11-28 18:30:54,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:54,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161193250] [2019-11-28 18:30:54,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:54,967 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 18:30:54,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161193250] [2019-11-28 18:30:54,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:54,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:30:54,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174874112] [2019-11-28 18:30:54,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:30:54,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:30:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:30:54,970 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 11 states. [2019-11-28 18:30:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:56,062 INFO L93 Difference]: Finished difference Result 1139 states and 2440 transitions. [2019-11-28 18:30:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 18:30:56,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-28 18:30:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:56,065 INFO L225 Difference]: With dead ends: 1139 [2019-11-28 18:30:56,065 INFO L226 Difference]: Without dead ends: 828 [2019-11-28 18:30:56,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-11-28 18:30:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-11-28 18:30:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-11-28 18:30:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-28 18:30:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1812 transitions. [2019-11-28 18:30:56,077 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1812 transitions. Word has length 52 [2019-11-28 18:30:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:56,077 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1812 transitions. [2019-11-28 18:30:56,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:30:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1812 transitions. [2019-11-28 18:30:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:56,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:56,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:56,080 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash 793934666, now seen corresponding path program 4 times [2019-11-28 18:30:56,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:56,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969420240] [2019-11-28 18:30:56,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:56,314 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 18:30:56,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969420240] [2019-11-28 18:30:56,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:56,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:30:56,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231641143] [2019-11-28 18:30:56,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:30:56,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:30:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:30:56,316 INFO L87 Difference]: Start difference. First operand 828 states and 1812 transitions. Second operand 12 states. [2019-11-28 18:30:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,365 INFO L93 Difference]: Finished difference Result 1154 states and 2472 transitions. [2019-11-28 18:30:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 18:30:57,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-11-28 18:30:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,367 INFO L225 Difference]: With dead ends: 1154 [2019-11-28 18:30:57,368 INFO L226 Difference]: Without dead ends: 777 [2019-11-28 18:30:57,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-11-28 18:30:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-11-28 18:30:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 768. [2019-11-28 18:30:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-28 18:30:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1674 transitions. [2019-11-28 18:30:57,379 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1674 transitions. Word has length 52 [2019-11-28 18:30:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,379 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1674 transitions. [2019-11-28 18:30:57,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:30:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1674 transitions. [2019-11-28 18:30:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:57,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:57,381 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907066, now seen corresponding path program 5 times [2019-11-28 18:30:57,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539758116] [2019-11-28 18:30:57,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:57,480 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 18:30:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539758116] [2019-11-28 18:30:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:57,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:30:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668347813] [2019-11-28 18:30:57,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:30:57,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:30:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:30:57,481 INFO L87 Difference]: Start difference. First operand 768 states and 1674 transitions. Second operand 7 states. [2019-11-28 18:30:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:57,655 INFO L93 Difference]: Finished difference Result 1250 states and 2650 transitions. [2019-11-28 18:30:57,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:57,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:30:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:57,657 INFO L225 Difference]: With dead ends: 1250 [2019-11-28 18:30:57,658 INFO L226 Difference]: Without dead ends: 919 [2019-11-28 18:30:57,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:30:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-11-28 18:30:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-11-28 18:30:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-28 18:30:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-11-28 18:30:57,673 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-11-28 18:30:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:57,674 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-11-28 18:30:57,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:30:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-11-28 18:30:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:57,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:57,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:57,676 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:30:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 6 times [2019-11-28 18:30:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:57,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521675745] [2019-11-28 18:30:57,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:30:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:30:57,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:30:57,783 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:30:57,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:57,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-11-28 18:30:57,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In-1275925583 ~y$r_buff1_thd2~0_Out-1275925583) (= 1 ~x~0_Out-1275925583) (= 1 ~y$r_buff0_thd1~0_Out-1275925583) (= ~y$r_buff1_thd0~0_Out-1275925583 ~y$r_buff0_thd0~0_In-1275925583) (= ~y$r_buff1_thd1~0_Out-1275925583 ~y$r_buff0_thd1~0_In-1275925583) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1275925583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1275925583, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1275925583, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1275925583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1275925583, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583, ~x~0=~x~0_Out-1275925583, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1275925583} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:30:57,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1364153858 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1364153858 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1364153858| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1364153858| ~y$w_buff0_used~0_In-1364153858) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1364153858, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1364153858} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1364153858|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1364153858, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1364153858} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:30:57,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1403330770 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1403330770 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1403330770 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1403330770 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1403330770| ~y$w_buff0_used~0_In1403330770) (= |P1Thread1of1ForFork1_#t~ite20_Out1403330770| |P1Thread1of1ForFork1_#t~ite21_Out1403330770|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1403330770| ~y$w_buff0_used~0_In1403330770) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In1403330770| |P1Thread1of1ForFork1_#t~ite20_Out1403330770|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1403330770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1403330770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1403330770, ~weak$$choice2~0=~weak$$choice2~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1403330770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1403330770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1403330770, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1403330770|, ~weak$$choice2~0=~weak$$choice2~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:30:57,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1114368751 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In1114368751 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In1114368751 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite24_Out1114368751|))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) .cse1 (or (not .cse2) .cse3) (or (not .cse4) .cse3) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite22_In1114368751| |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1114368751| ~y$w_buff1_used~0_In1114368751) (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite23_In1114368751|) (not .cse1)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| ~y$w_buff1_used~0_In1114368751) (or (and .cse2 .cse6) (and .cse4 .cse6) .cse0) .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1114368751|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1114368751|, ~weak$$choice2~0=~weak$$choice2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1114368751|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1114368751|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1114368751|, ~weak$$choice2~0=~weak$$choice2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:30:57,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1420379201 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1420379201 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1420379201 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1420379201 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1420379201 |P0Thread1of1ForFork0_#t~ite6_Out1420379201|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1420379201|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1420379201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1420379201, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1420379201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1420379201} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1420379201|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1420379201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1420379201, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1420379201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1420379201} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:30:57,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out223657384 ~y$r_buff0_thd1~0_In223657384)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In223657384 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In223657384 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out223657384)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In223657384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out223657384|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out223657384} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:30:57,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-94498083 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-94498083 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-94498083 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-94498083 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-94498083| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-94498083| ~y$r_buff1_thd1~0_In-94498083) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-94498083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-94498083, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-94498083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94498083} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-94498083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-94498083, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-94498083|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-94498083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94498083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:30:57,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:57,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2019514602 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-2019514602| |P1Thread1of1ForFork1_#t~ite30_Out-2019514602|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2019514602 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-2019514602 256) 0)) (= (mod ~y$w_buff0_used~0_In-2019514602 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2019514602 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2019514602| ~y$r_buff1_thd2~0_In-2019514602)) (and (= ~y$r_buff1_thd2~0_In-2019514602 |P1Thread1of1ForFork1_#t~ite30_Out-2019514602|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-2019514602| |P1Thread1of1ForFork1_#t~ite29_Out-2019514602|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2019514602, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2019514602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019514602, ~weak$$choice2~0=~weak$$choice2~0_In-2019514602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2019514602} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2019514602, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2019514602|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2019514602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019514602, ~weak$$choice2~0=~weak$$choice2~0_In-2019514602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2019514602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:30:57,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2129184326 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2129184326 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-2129184326| ~y$w_buff1~0_In-2129184326)) (and (= ~y~0_In-2129184326 |P1Thread1of1ForFork1_#t~ite32_Out-2129184326|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2129184326, ~y$w_buff1~0=~y$w_buff1~0_In-2129184326, ~y~0=~y~0_In-2129184326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129184326} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2129184326, ~y$w_buff1~0=~y$w_buff1~0_In-2129184326, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2129184326|, ~y~0=~y~0_In-2129184326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129184326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:30:57,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1404050155 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1404050155 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1404050155|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1404050155| ~y$w_buff0_used~0_In1404050155) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1404050155|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:30:57,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1372257250 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1372257250 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1372257250 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1372257250 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1372257250| ~y$w_buff1_used~0_In-1372257250)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1372257250| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1372257250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1372257250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1372257250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1372257250} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1372257250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1372257250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1372257250, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1372257250|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1372257250} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:30:57,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-340973494 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-340973494 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-340973494|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-340973494 |P1Thread1of1ForFork1_#t~ite36_Out-340973494|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-340973494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-340973494} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-340973494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-340973494, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-340973494|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:30:57,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1119754997 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1119754997 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1119754997 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1119754997 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1119754997| ~y$r_buff1_thd2~0_In1119754997)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1119754997| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1119754997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1119754997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1119754997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1119754997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1119754997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1119754997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1119754997, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1119754997|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1119754997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:30:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:30:57,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2086063597 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2086063597 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2086063597| ~y$w_buff1~0_In2086063597) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2086063597| ~y~0_In2086063597)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2086063597, ~y~0=~y~0_In2086063597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2086063597|, ~y$w_buff1~0=~y$w_buff1~0_In2086063597, ~y~0=~y~0_In2086063597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:30:57,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1259884934 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1259884934 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1259884934| 0)) (and (= ~y$w_buff0_used~0_In-1259884934 |ULTIMATE.start_main_#t~ite42_Out-1259884934|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259884934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259884934} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259884934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259884934, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1259884934|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:30:57,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-460841796 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-460841796 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-460841796| ~y$w_buff1_used~0_In-460841796) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-460841796| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-460841796|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:30:57,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In308505757 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In308505757 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out308505757|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In308505757 |ULTIMATE.start_main_#t~ite44_Out308505757|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In308505757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In308505757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In308505757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In308505757, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out308505757|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:30:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-228465491 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-228465491 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-228465491 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-228465491 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-228465491| ~y$r_buff1_thd0~0_In-228465491) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-228465491|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-228465491, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-228465491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-228465491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-228465491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-228465491, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-228465491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-228465491, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-228465491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-228465491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:30:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:30:57,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:30:57 BasicIcfg [2019-11-28 18:30:57,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:30:57,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:30:57,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:30:57,863 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:30:57,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:39" (3/4) ... [2019-11-28 18:30:57,866 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:30:57,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:57,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-11-28 18:30:57,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In-1275925583 ~y$r_buff1_thd2~0_Out-1275925583) (= 1 ~x~0_Out-1275925583) (= 1 ~y$r_buff0_thd1~0_Out-1275925583) (= ~y$r_buff1_thd0~0_Out-1275925583 ~y$r_buff0_thd0~0_In-1275925583) (= ~y$r_buff1_thd1~0_Out-1275925583 ~y$r_buff0_thd1~0_In-1275925583) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1275925583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1275925583, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1275925583, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1275925583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1275925583, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1275925583, ~x~0=~x~0_Out-1275925583, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1275925583} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:30:57,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1364153858 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1364153858 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1364153858| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1364153858| ~y$w_buff0_used~0_In-1364153858) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1364153858, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1364153858} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1364153858|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1364153858, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1364153858} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:30:57,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1403330770 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1403330770 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In1403330770 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1403330770 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1403330770| ~y$w_buff0_used~0_In1403330770) (= |P1Thread1of1ForFork1_#t~ite20_Out1403330770| |P1Thread1of1ForFork1_#t~ite21_Out1403330770|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1403330770| ~y$w_buff0_used~0_In1403330770) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In1403330770| |P1Thread1of1ForFork1_#t~ite20_Out1403330770|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1403330770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1403330770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1403330770, ~weak$$choice2~0=~weak$$choice2~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1403330770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1403330770|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1403330770, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1403330770|, ~weak$$choice2~0=~weak$$choice2~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:30:57,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1114368751 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In1114368751 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In1114368751 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite24_Out1114368751|))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) .cse1 (or (not .cse2) .cse3) (or (not .cse4) .cse3) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite22_In1114368751| |P1Thread1of1ForFork1_#t~ite22_Out1114368751|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1114368751| ~y$w_buff1_used~0_In1114368751) (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| |P1Thread1of1ForFork1_#t~ite23_In1114368751|) (not .cse1)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1114368751| ~y$w_buff1_used~0_In1114368751) (or (and .cse2 .cse6) (and .cse4 .cse6) .cse0) .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1114368751|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1114368751|, ~weak$$choice2~0=~weak$$choice2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1114368751|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1114368751|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1114368751|, ~weak$$choice2~0=~weak$$choice2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:30:57,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1420379201 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1420379201 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1420379201 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1420379201 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1420379201 |P0Thread1of1ForFork0_#t~ite6_Out1420379201|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1420379201|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1420379201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1420379201, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1420379201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1420379201} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1420379201|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1420379201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1420379201, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1420379201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1420379201} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:30:57,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_Out223657384 ~y$r_buff0_thd1~0_In223657384)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In223657384 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In223657384 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out223657384)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In223657384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out223657384|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out223657384} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:30:57,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-94498083 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-94498083 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-94498083 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-94498083 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-94498083| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-94498083| ~y$r_buff1_thd1~0_In-94498083) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-94498083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-94498083, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-94498083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94498083} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-94498083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-94498083, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-94498083|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-94498083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94498083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:30:57,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:57,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2019514602 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-2019514602| |P1Thread1of1ForFork1_#t~ite30_Out-2019514602|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2019514602 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-2019514602 256) 0)) (= (mod ~y$w_buff0_used~0_In-2019514602 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2019514602 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2019514602| ~y$r_buff1_thd2~0_In-2019514602)) (and (= ~y$r_buff1_thd2~0_In-2019514602 |P1Thread1of1ForFork1_#t~ite30_Out-2019514602|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-2019514602| |P1Thread1of1ForFork1_#t~ite29_Out-2019514602|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2019514602, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2019514602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019514602, ~weak$$choice2~0=~weak$$choice2~0_In-2019514602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2019514602} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2019514602, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2019514602|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2019514602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019514602, ~weak$$choice2~0=~weak$$choice2~0_In-2019514602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2019514602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:30:57,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2129184326 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2129184326 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-2129184326| ~y$w_buff1~0_In-2129184326)) (and (= ~y~0_In-2129184326 |P1Thread1of1ForFork1_#t~ite32_Out-2129184326|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2129184326, ~y$w_buff1~0=~y$w_buff1~0_In-2129184326, ~y~0=~y~0_In-2129184326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129184326} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2129184326, ~y$w_buff1~0=~y$w_buff1~0_In-2129184326, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2129184326|, ~y~0=~y~0_In-2129184326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129184326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:30:57,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1404050155 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1404050155 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1404050155|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1404050155| ~y$w_buff0_used~0_In1404050155) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1404050155|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:30:57,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1372257250 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1372257250 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1372257250 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1372257250 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1372257250| ~y$w_buff1_used~0_In-1372257250)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1372257250| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1372257250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1372257250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1372257250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1372257250} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1372257250, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1372257250, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1372257250, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1372257250|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1372257250} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:30:57,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-340973494 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-340973494 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-340973494|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-340973494 |P1Thread1of1ForFork1_#t~ite36_Out-340973494|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-340973494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-340973494} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-340973494, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-340973494, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-340973494|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:30:57,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1119754997 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1119754997 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1119754997 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1119754997 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1119754997| ~y$r_buff1_thd2~0_In1119754997)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1119754997| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1119754997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1119754997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1119754997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1119754997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1119754997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1119754997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1119754997, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1119754997|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1119754997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:30:57,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:30:57,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2086063597 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2086063597 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2086063597| ~y$w_buff1~0_In2086063597) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2086063597| ~y~0_In2086063597)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2086063597, ~y~0=~y~0_In2086063597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2086063597|, ~y$w_buff1~0=~y$w_buff1~0_In2086063597, ~y~0=~y~0_In2086063597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:30:57,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1259884934 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1259884934 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1259884934| 0)) (and (= ~y$w_buff0_used~0_In-1259884934 |ULTIMATE.start_main_#t~ite42_Out-1259884934|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259884934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259884934} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259884934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259884934, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1259884934|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:30:57,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-460841796 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-460841796 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-460841796| ~y$w_buff1_used~0_In-460841796) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-460841796| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-460841796|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:30:57,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In308505757 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In308505757 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out308505757|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In308505757 |ULTIMATE.start_main_#t~ite44_Out308505757|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In308505757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In308505757} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In308505757, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In308505757, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out308505757|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:30:57,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-228465491 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-228465491 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-228465491 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-228465491 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-228465491| ~y$r_buff1_thd0~0_In-228465491) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-228465491|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-228465491, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-228465491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-228465491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-228465491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-228465491, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-228465491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-228465491, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-228465491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-228465491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:30:57,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:30:57,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:30:57,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:30:57,965 INFO L168 Benchmark]: Toolchain (without parser) took 19823.44 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 879.2 MB). Free memory was 956.3 MB in the beginning and 1.6 GB in the end (delta: -647.3 MB). Peak memory consumption was 231.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,966 INFO L168 Benchmark]: CDTParser took 0.27 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 18:30:57,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.12 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 18:30:57,967 INFO L168 Benchmark]: Boogie Preprocessor took 45.52 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 18:30:57,969 INFO L168 Benchmark]: RCFGBuilder took 746.63 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,973 INFO L168 Benchmark]: TraceAbstraction took 18127.36 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 756.0 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -583.4 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,974 INFO L168 Benchmark]: Witness Printer took 100.13 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,981 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.27 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 739.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.12 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 45.52 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 746.63 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18127.36 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 756.0 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -583.4 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. * Witness Printer took 100.13 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1925 SDtfs, 2872 SDslu, 5107 SDs, 0 SdLazy, 4444 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15237occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 6207 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 494 ConstructedInterpolants, 0 QuantifiedInterpolants, 118725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...