./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004_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/rfi004_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 d4fe48e4b8c59fe3970fc6e37e17f6ef3138320d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:32,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:32,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:32,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:32,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:32,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:32,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:32,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:32,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:32,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:32,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:32,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:32,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:32,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:32,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:32,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:32,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:32,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:32,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:32,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:32,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:32,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:32,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:32,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:32,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:32,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:32,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:32,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:32,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:32,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:32,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:32,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:32,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:32,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:32,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:32,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:32,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:32,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:32,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:32,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:32,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:32,921 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:22:32,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:32,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:32,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:32,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:32,945 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:32,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:32,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:32,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:32,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:32,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:32,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:32,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:32,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:32,947 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:32,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:32,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:32,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:32,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:32,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:32,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:32,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:32,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:32,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:32,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:32,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:32,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:32,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:32,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:32,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:32,952 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 -> d4fe48e4b8c59fe3970fc6e37e17f6ef3138320d [2019-11-28 18:22:33,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:33,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:33,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:33,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:33,344 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:33,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004_power.opt.i [2019-11-28 18:22:33,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5feca1c65/96d1665512b143aa8c8e375fa9b98961/FLAG863a74267 [2019-11-28 18:22:33,984 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:33,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004_power.opt.i [2019-11-28 18:22:34,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5feca1c65/96d1665512b143aa8c8e375fa9b98961/FLAG863a74267 [2019-11-28 18:22:34,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5feca1c65/96d1665512b143aa8c8e375fa9b98961 [2019-11-28 18:22:34,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:34,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:34,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:34,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:34,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:34,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:34" (1/1) ... [2019-11-28 18:22:34,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f758ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:34, skipping insertion in model container [2019-11-28 18:22:34,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:34" (1/1) ... [2019-11-28 18:22:34,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:34,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:34,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:34,849 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:34,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:35,005 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:35,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35 WrapperNode [2019-11-28 18:22:35,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:35,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:35,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:35,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:35,017 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:22:35" (1/1) ... [2019-11-28 18:22:35,037 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:22:35" (1/1) ... [2019-11-28 18:22:35,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:35,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:35,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:35,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:35,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:35,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:35,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:35,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:35,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (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:22:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:35,193 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:22:35,845 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:35,846 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:35,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:35 BoogieIcfgContainer [2019-11-28 18:22:35,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:35,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:35,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:35,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:35,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:34" (1/3) ... [2019-11-28 18:22:35,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2fbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:35, skipping insertion in model container [2019-11-28 18:22:35,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35" (2/3) ... [2019-11-28 18:22:35,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2fbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:35, skipping insertion in model container [2019-11-28 18:22:35,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:35" (3/3) ... [2019-11-28 18:22:35,857 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt.i [2019-11-28 18:22:35,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:35,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:35,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:35,884 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:35,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:36,013 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:36,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:36,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:36,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:36,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:36,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:36,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:36,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:36,036 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:36,054 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-11-28 18:22:36,057 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:36,133 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:36,134 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:36,148 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:36,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:36,228 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:36,228 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:36,236 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:36,254 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:36,255 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:40,722 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:22:40,841 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:22:40,925 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-11-28 18:22:40,925 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-11-28 18:22:40,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:22:41,380 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-11-28 18:22:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-11-28 18:22:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:41,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:41,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:41,399 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-11-28 18:22:41,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:41,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530153688] [2019-11-28 18:22:41,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:41,698 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:22:41,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530153688] [2019-11-28 18:22:41,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:41,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:41,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518399578] [2019-11-28 18:22:41,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:41,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:41,724 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-11-28 18:22:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:41,974 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-11-28 18:22:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:41,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:42,051 INFO L225 Difference]: With dead ends: 6636 [2019-11-28 18:22:42,051 INFO L226 Difference]: Without dead ends: 6246 [2019-11-28 18:22:42,053 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:22:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-11-28 18:22:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-11-28 18:22:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-11-28 18:22:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-11-28 18:22:42,613 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-11-28 18:22:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:42,614 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-11-28 18:22:42,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-11-28 18:22:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:42,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:42,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:42,620 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-11-28 18:22:42,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:42,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904020928] [2019-11-28 18:22:42,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:42,770 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:22:42,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904020928] [2019-11-28 18:22:42,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:42,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:42,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117281710] [2019-11-28 18:22:42,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:42,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:42,774 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-11-28 18:22:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:42,856 INFO L93 Difference]: Finished difference Result 1666 states and 4431 transitions. [2019-11-28 18:22:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:42,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:42,865 INFO L225 Difference]: With dead ends: 1666 [2019-11-28 18:22:42,865 INFO L226 Difference]: Without dead ends: 1276 [2019-11-28 18:22:42,866 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:22:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-11-28 18:22:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-11-28 18:22:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-11-28 18:22:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3147 transitions. [2019-11-28 18:22:42,904 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3147 transitions. Word has length 11 [2019-11-28 18:22:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:42,904 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3147 transitions. [2019-11-28 18:22:42,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3147 transitions. [2019-11-28 18:22:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:42,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:42,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:42,907 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-11-28 18:22:42,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:42,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118013604] [2019-11-28 18:22:42,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:42,958 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:22:42,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118013604] [2019-11-28 18:22:42,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:42,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:42,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245095886] [2019-11-28 18:22:42,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:42,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:42,961 INFO L87 Difference]: Start difference. First operand 1276 states and 3147 transitions. Second operand 3 states. [2019-11-28 18:22:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:43,056 INFO L93 Difference]: Finished difference Result 1986 states and 4934 transitions. [2019-11-28 18:22:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:43,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:43,072 INFO L225 Difference]: With dead ends: 1986 [2019-11-28 18:22:43,073 INFO L226 Difference]: Without dead ends: 1986 [2019-11-28 18:22:43,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-11-28 18:22:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1490. [2019-11-28 18:22:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-11-28 18:22:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 3702 transitions. [2019-11-28 18:22:43,139 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 3702 transitions. Word has length 14 [2019-11-28 18:22:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:43,140 INFO L462 AbstractCegarLoop]: Abstraction has 1490 states and 3702 transitions. [2019-11-28 18:22:43,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 3702 transitions. [2019-11-28 18:22:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:43,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:43,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:43,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-11-28 18:22:43,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:43,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519920930] [2019-11-28 18:22:43,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:43,271 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:22:43,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519920930] [2019-11-28 18:22:43,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:43,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016046843] [2019-11-28 18:22:43,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:43,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:43,277 INFO L87 Difference]: Start difference. First operand 1490 states and 3702 transitions. Second operand 4 states. [2019-11-28 18:22:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:43,503 INFO L93 Difference]: Finished difference Result 1934 states and 4662 transitions. [2019-11-28 18:22:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:43,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:43,517 INFO L225 Difference]: With dead ends: 1934 [2019-11-28 18:22:43,517 INFO L226 Difference]: Without dead ends: 1919 [2019-11-28 18:22:43,518 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:22:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-11-28 18:22:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1755. [2019-11-28 18:22:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-11-28 18:22:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 4270 transitions. [2019-11-28 18:22:43,579 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 4270 transitions. Word has length 14 [2019-11-28 18:22:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:43,580 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 4270 transitions. [2019-11-28 18:22:43,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 4270 transitions. [2019-11-28 18:22:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:43,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:43,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:43,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-11-28 18:22:43,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:43,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831962353] [2019-11-28 18:22:43,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:43,695 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:22:43,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831962353] [2019-11-28 18:22:43,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:43,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:43,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433237371] [2019-11-28 18:22:43,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:43,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:43,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:43,698 INFO L87 Difference]: Start difference. First operand 1755 states and 4270 transitions. Second operand 4 states. [2019-11-28 18:22:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:43,867 INFO L93 Difference]: Finished difference Result 2157 states and 5151 transitions. [2019-11-28 18:22:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:43,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:43,880 INFO L225 Difference]: With dead ends: 2157 [2019-11-28 18:22:43,880 INFO L226 Difference]: Without dead ends: 2136 [2019-11-28 18:22:43,881 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:22:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-11-28 18:22:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1779. [2019-11-28 18:22:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-28 18:22:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4301 transitions. [2019-11-28 18:22:43,937 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4301 transitions. Word has length 14 [2019-11-28 18:22:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:43,937 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4301 transitions. [2019-11-28 18:22:43,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4301 transitions. [2019-11-28 18:22:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:43,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:43,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:43,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-11-28 18:22:43,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:43,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388632787] [2019-11-28 18:22:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:44,045 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:22:44,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388632787] [2019-11-28 18:22:44,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:44,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:44,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219434832] [2019-11-28 18:22:44,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:44,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:44,050 INFO L87 Difference]: Start difference. First operand 1779 states and 4301 transitions. Second operand 5 states. [2019-11-28 18:22:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:44,112 INFO L93 Difference]: Finished difference Result 923 states and 2095 transitions. [2019-11-28 18:22:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:44,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:44,119 INFO L225 Difference]: With dead ends: 923 [2019-11-28 18:22:44,119 INFO L226 Difference]: Without dead ends: 819 [2019-11-28 18:22:44,120 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:22:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-28 18:22:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 774. [2019-11-28 18:22:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-28 18:22:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1752 transitions. [2019-11-28 18:22:44,143 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1752 transitions. Word has length 26 [2019-11-28 18:22:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:44,144 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1752 transitions. [2019-11-28 18:22:44,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1752 transitions. [2019-11-28 18:22:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:22:44,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:44,147 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] [2019-11-28 18:22:44,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-11-28 18:22:44,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:44,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239607927] [2019-11-28 18:22:44,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:44,336 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:22:44,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239607927] [2019-11-28 18:22:44,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:44,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:44,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685484466] [2019-11-28 18:22:44,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:44,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:44,341 INFO L87 Difference]: Start difference. First operand 774 states and 1752 transitions. Second operand 6 states. [2019-11-28 18:22:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:44,881 INFO L93 Difference]: Finished difference Result 1275 states and 2784 transitions. [2019-11-28 18:22:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:44,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:22:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:44,889 INFO L225 Difference]: With dead ends: 1275 [2019-11-28 18:22:44,890 INFO L226 Difference]: Without dead ends: 1275 [2019-11-28 18:22:44,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-28 18:22:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1021. [2019-11-28 18:22:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-11-28 18:22:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2284 transitions. [2019-11-28 18:22:44,917 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2284 transitions. Word has length 41 [2019-11-28 18:22:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:44,917 INFO L462 AbstractCegarLoop]: Abstraction has 1021 states and 2284 transitions. [2019-11-28 18:22:44,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2284 transitions. [2019-11-28 18:22:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:22:44,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:44,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:44,921 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 166240103, now seen corresponding path program 2 times [2019-11-28 18:22:44,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:44,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816445806] [2019-11-28 18:22:44,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:45,024 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:22:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816445806] [2019-11-28 18:22:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:45,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:45,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735801983] [2019-11-28 18:22:45,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:45,027 INFO L87 Difference]: Start difference. First operand 1021 states and 2284 transitions. Second operand 3 states. [2019-11-28 18:22:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:45,041 INFO L93 Difference]: Finished difference Result 1019 states and 2279 transitions. [2019-11-28 18:22:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:45,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:22:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:45,048 INFO L225 Difference]: With dead ends: 1019 [2019-11-28 18:22:45,048 INFO L226 Difference]: Without dead ends: 1019 [2019-11-28 18:22:45,049 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:22:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-28 18:22:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 895. [2019-11-28 18:22:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-28 18:22:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2029 transitions. [2019-11-28 18:22:45,072 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2029 transitions. Word has length 41 [2019-11-28 18:22:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 2029 transitions. [2019-11-28 18:22:45,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2029 transitions. [2019-11-28 18:22:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:45,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:45,076 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] [2019-11-28 18:22:45,077 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-11-28 18:22:45,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:45,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873834120] [2019-11-28 18:22:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:45,171 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:22:45,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873834120] [2019-11-28 18:22:45,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:45,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:22:45,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135347472] [2019-11-28 18:22:45,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:45,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:45,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:45,174 INFO L87 Difference]: Start difference. First operand 895 states and 2029 transitions. Second operand 6 states. [2019-11-28 18:22:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:45,434 INFO L93 Difference]: Finished difference Result 2095 states and 4663 transitions. [2019-11-28 18:22:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:45,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:22:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:45,441 INFO L225 Difference]: With dead ends: 2095 [2019-11-28 18:22:45,441 INFO L226 Difference]: Without dead ends: 1429 [2019-11-28 18:22:45,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-11-28 18:22:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 960. [2019-11-28 18:22:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-11-28 18:22:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2183 transitions. [2019-11-28 18:22:45,468 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2183 transitions. Word has length 42 [2019-11-28 18:22:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:45,468 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2183 transitions. [2019-11-28 18:22:45,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2183 transitions. [2019-11-28 18:22:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:45,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:45,471 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] [2019-11-28 18:22:45,471 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-11-28 18:22:45,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:45,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665173123] [2019-11-28 18:22:45,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:45,926 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:22:45,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665173123] [2019-11-28 18:22:45,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:45,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:22:45,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582994691] [2019-11-28 18:22:45,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:22:45,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:22:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:22:45,928 INFO L87 Difference]: Start difference. First operand 960 states and 2183 transitions. Second operand 13 states. [2019-11-28 18:22:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:47,302 INFO L93 Difference]: Finished difference Result 2227 states and 4959 transitions. [2019-11-28 18:22:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:22:47,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-11-28 18:22:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:47,309 INFO L225 Difference]: With dead ends: 2227 [2019-11-28 18:22:47,309 INFO L226 Difference]: Without dead ends: 1905 [2019-11-28 18:22:47,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2019-11-28 18:22:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-11-28 18:22:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1038. [2019-11-28 18:22:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-11-28 18:22:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 2364 transitions. [2019-11-28 18:22:47,347 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 2364 transitions. Word has length 42 [2019-11-28 18:22:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,347 INFO L462 AbstractCegarLoop]: Abstraction has 1038 states and 2364 transitions. [2019-11-28 18:22:47,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:22:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 2364 transitions. [2019-11-28 18:22:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:47,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,351 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] [2019-11-28 18:22:47,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1940739036, now seen corresponding path program 3 times [2019-11-28 18:22:47,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335603912] [2019-11-28 18:22:47,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:47,462 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:22:47,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335603912] [2019-11-28 18:22:47,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:47,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:47,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919815256] [2019-11-28 18:22:47,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:22:47,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:47,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:22:47,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:47,465 INFO L87 Difference]: Start difference. First operand 1038 states and 2364 transitions. Second operand 7 states. [2019-11-28 18:22:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:47,665 INFO L93 Difference]: Finished difference Result 2060 states and 4582 transitions. [2019-11-28 18:22:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:22:47,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:22:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:47,671 INFO L225 Difference]: With dead ends: 2060 [2019-11-28 18:22:47,671 INFO L226 Difference]: Without dead ends: 1670 [2019-11-28 18:22:47,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:22:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-11-28 18:22:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1049. [2019-11-28 18:22:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-11-28 18:22:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2390 transitions. [2019-11-28 18:22:47,712 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2390 transitions. Word has length 42 [2019-11-28 18:22:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,712 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 2390 transitions. [2019-11-28 18:22:47,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:22:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2390 transitions. [2019-11-28 18:22:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:47,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,716 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] [2019-11-28 18:22:47,716 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash -903915298, now seen corresponding path program 4 times [2019-11-28 18:22:47,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969437332] [2019-11-28 18:22:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,061 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:22:48,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969437332] [2019-11-28 18:22:48,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:22:48,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658699811] [2019-11-28 18:22:48,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:22:48,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:22:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:22:48,064 INFO L87 Difference]: Start difference. First operand 1049 states and 2390 transitions. Second operand 10 states. [2019-11-28 18:22:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,672 INFO L93 Difference]: Finished difference Result 2460 states and 5481 transitions. [2019-11-28 18:22:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:22:48,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-11-28 18:22:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,683 INFO L225 Difference]: With dead ends: 2460 [2019-11-28 18:22:48,683 INFO L226 Difference]: Without dead ends: 1779 [2019-11-28 18:22:48,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:22:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-11-28 18:22:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1389. [2019-11-28 18:22:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-11-28 18:22:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 3153 transitions. [2019-11-28 18:22:48,716 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 3153 transitions. Word has length 42 [2019-11-28 18:22:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,717 INFO L462 AbstractCegarLoop]: Abstraction has 1389 states and 3153 transitions. [2019-11-28 18:22:48,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:22:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 3153 transitions. [2019-11-28 18:22:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:48,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,721 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] [2019-11-28 18:22:48,721 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1647114940, now seen corresponding path program 5 times [2019-11-28 18:22:48,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433947822] [2019-11-28 18:22:48,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,827 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:22:48,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433947822] [2019-11-28 18:22:48,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:48,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890220477] [2019-11-28 18:22:48,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:48,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:48,829 INFO L87 Difference]: Start difference. First operand 1389 states and 3153 transitions. Second operand 5 states. [2019-11-28 18:22:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,866 INFO L93 Difference]: Finished difference Result 1534 states and 3439 transitions. [2019-11-28 18:22:48,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:48,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:22:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,868 INFO L225 Difference]: With dead ends: 1534 [2019-11-28 18:22:48,869 INFO L226 Difference]: Without dead ends: 708 [2019-11-28 18:22:48,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-28 18:22:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-11-28 18:22:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-28 18:22:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1597 transitions. [2019-11-28 18:22:48,887 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1597 transitions. Word has length 42 [2019-11-28 18:22:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,887 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1597 transitions. [2019-11-28 18:22:48,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1597 transitions. [2019-11-28 18:22:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:48,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,890 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] [2019-11-28 18:22:48,890 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 6 times [2019-11-28 18:22:48,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976530806] [2019-11-28 18:22:48,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,043 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:22:49,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976530806] [2019-11-28 18:22:49,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:49,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603197074] [2019-11-28 18:22:49,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:22:49,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:22:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,045 INFO L87 Difference]: Start difference. First operand 708 states and 1597 transitions. Second operand 7 states. [2019-11-28 18:22:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,231 INFO L93 Difference]: Finished difference Result 1114 states and 2433 transitions. [2019-11-28 18:22:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:49,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:22:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,234 INFO L225 Difference]: With dead ends: 1114 [2019-11-28 18:22:49,234 INFO L226 Difference]: Without dead ends: 761 [2019-11-28 18:22:49,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:22:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-28 18:22:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 696. [2019-11-28 18:22:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-28 18:22:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1571 transitions. [2019-11-28 18:22:49,250 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1571 transitions. Word has length 42 [2019-11-28 18:22:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,250 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1571 transitions. [2019-11-28 18:22:49,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:22:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1571 transitions. [2019-11-28 18:22:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,252 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] [2019-11-28 18:22:49,253 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 7 times [2019-11-28 18:22:49,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091137429] [2019-11-28 18:22:49,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:49,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:49,369 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:49,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19|)) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19| 1)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0))) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1651~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~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_794, ULTIMATE.start_main_~#t1651~0.base=|v_ULTIMATE.start_main_~#t1651~0.base_19|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1651~0.offset=|v_ULTIMATE.start_main_~#t1651~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1651~0.base, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1652~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~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, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1652~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1651~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~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:22:49,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9| 1)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1652~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1652~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9|) |v_ULTIMATE.start_main_~#t1652~0.offset_8| 1))) (not (= |v_ULTIMATE.start_main_~#t1652~0.base_9| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1652~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1652~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1652~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:49,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:49,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1731148846 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1731148846 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1731148846| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1731148846| ~y$w_buff0_used~0_In-1731148846) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731148846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1731148846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731148846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1731148846, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1731148846|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2012687658 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2012687658 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2012687658 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2012687658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out2012687658| ~y$w_buff1_used~0_In2012687658)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2012687658| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2012687658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2012687658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2012687658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2012687658} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2012687658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2012687658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2012687658, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2012687658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2012687658} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:49,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In-495008858 ~y$r_buff0_thd2~0_Out-495008858)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-495008858 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-495008858 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd2~0_Out-495008858 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-495008858, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-495008858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-495008858, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-495008858|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-495008858} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:49,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In883193444 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite18_Out883193444| |P0Thread1of1ForFork1_#t~ite17_Out883193444|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In883193444 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In883193444 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In883193444 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In883193444 256)))) .cse1 (= ~y$w_buff1_used~0_In883193444 |P0Thread1of1ForFork1_#t~ite17_Out883193444|)) (and (= |P0Thread1of1ForFork1_#t~ite17_In883193444| |P0Thread1of1ForFork1_#t~ite17_Out883193444|) (= ~y$w_buff1_used~0_In883193444 |P0Thread1of1ForFork1_#t~ite18_Out883193444|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In883193444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In883193444, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In883193444, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In883193444|, ~weak$$choice2~0=~weak$$choice2~0_In883193444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In883193444} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In883193444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In883193444, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In883193444, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out883193444|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out883193444|, ~weak$$choice2~0=~weak$$choice2~0_In883193444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In883193444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:49,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-85785732 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-85785732 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-85785732 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-85785732 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-85785732|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-85785732 |P1Thread1of1ForFork0_#t~ite31_Out-85785732|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-85785732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-85785732, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85785732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-85785732} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-85785732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-85785732, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-85785732|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85785732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-85785732} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:49,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:49,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1147972370 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1147972370 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1147972370| ~y$w_buff1~0_In-1147972370)) (and (= |ULTIMATE.start_main_#t~ite34_Out-1147972370| ~y~0_In-1147972370) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1147972370, ~y~0=~y~0_In-1147972370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147972370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147972370} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1147972370, ~y~0=~y~0_In-1147972370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147972370, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1147972370|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147972370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In541539001 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In541539001 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In541539001 |ULTIMATE.start_main_#t~ite36_Out541539001|)) (and (= |ULTIMATE.start_main_#t~ite36_Out541539001| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In541539001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In541539001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In541539001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In541539001, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out541539001|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:49,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1531787860 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1531787860 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1531787860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1531787860 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out1531787860| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1531787860 |ULTIMATE.start_main_#t~ite37_Out1531787860|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1531787860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531787860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1531787860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531787860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1531787860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531787860, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1531787860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1531787860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531787860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:49,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1253144791 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1253144791 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1253144791|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1253144791| ~y$r_buff0_thd0~0_In1253144791)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1253144791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253144791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1253144791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253144791, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1253144791|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:49,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1128085220 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1128085220 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1128085220 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1128085220 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1128085220|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1128085220 |ULTIMATE.start_main_#t~ite39_Out-1128085220|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128085220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1128085220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1128085220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128085220} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128085220, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1128085220|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1128085220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1128085220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128085220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:49,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:49,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:49 BasicIcfg [2019-11-28 18:22:49,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:49,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:49,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:49,469 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:49,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:35" (3/4) ... [2019-11-28 18:22:49,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:49,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19|)) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19| 1)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0))) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1651~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~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_794, ULTIMATE.start_main_~#t1651~0.base=|v_ULTIMATE.start_main_~#t1651~0.base_19|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1651~0.offset=|v_ULTIMATE.start_main_~#t1651~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1651~0.base, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1652~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~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, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1652~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1651~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~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:22:49,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9| 1)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1652~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1652~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9|) |v_ULTIMATE.start_main_~#t1652~0.offset_8| 1))) (not (= |v_ULTIMATE.start_main_~#t1652~0.base_9| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1652~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1652~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1652~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:49,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:49,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1731148846 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1731148846 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1731148846| 0)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1731148846| ~y$w_buff0_used~0_In-1731148846) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731148846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1731148846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731148846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1731148846, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1731148846|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:49,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2012687658 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2012687658 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2012687658 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2012687658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out2012687658| ~y$w_buff1_used~0_In2012687658)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out2012687658| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2012687658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2012687658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2012687658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2012687658} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2012687658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2012687658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2012687658, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2012687658|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2012687658} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:49,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_In-495008858 ~y$r_buff0_thd2~0_Out-495008858)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-495008858 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-495008858 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd2~0_Out-495008858 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-495008858, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-495008858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-495008858, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-495008858|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-495008858} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:49,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In883193444 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite18_Out883193444| |P0Thread1of1ForFork1_#t~ite17_Out883193444|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In883193444 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In883193444 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In883193444 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In883193444 256)))) .cse1 (= ~y$w_buff1_used~0_In883193444 |P0Thread1of1ForFork1_#t~ite17_Out883193444|)) (and (= |P0Thread1of1ForFork1_#t~ite17_In883193444| |P0Thread1of1ForFork1_#t~ite17_Out883193444|) (= ~y$w_buff1_used~0_In883193444 |P0Thread1of1ForFork1_#t~ite18_Out883193444|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In883193444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In883193444, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In883193444, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In883193444|, ~weak$$choice2~0=~weak$$choice2~0_In883193444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In883193444} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In883193444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In883193444, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In883193444, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out883193444|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out883193444|, ~weak$$choice2~0=~weak$$choice2~0_In883193444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In883193444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:49,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:49,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-85785732 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-85785732 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-85785732 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-85785732 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-85785732|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-85785732 |P1Thread1of1ForFork0_#t~ite31_Out-85785732|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-85785732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-85785732, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85785732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-85785732} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-85785732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-85785732, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-85785732|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85785732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-85785732} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1147972370 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1147972370 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1147972370| ~y$w_buff1~0_In-1147972370)) (and (= |ULTIMATE.start_main_#t~ite34_Out-1147972370| ~y~0_In-1147972370) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1147972370, ~y~0=~y~0_In-1147972370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147972370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147972370} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1147972370, ~y~0=~y~0_In-1147972370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147972370, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1147972370|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147972370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In541539001 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In541539001 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In541539001 |ULTIMATE.start_main_#t~ite36_Out541539001|)) (and (= |ULTIMATE.start_main_#t~ite36_Out541539001| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In541539001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In541539001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In541539001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In541539001, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out541539001|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1531787860 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1531787860 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1531787860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1531787860 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out1531787860| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1531787860 |ULTIMATE.start_main_#t~ite37_Out1531787860|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1531787860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531787860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1531787860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531787860} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1531787860, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1531787860, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1531787860|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1531787860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531787860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:49,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1253144791 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1253144791 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1253144791|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1253144791| ~y$r_buff0_thd0~0_In1253144791)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1253144791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253144791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1253144791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253144791, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1253144791|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:49,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1128085220 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1128085220 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1128085220 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1128085220 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1128085220|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1128085220 |ULTIMATE.start_main_#t~ite39_Out-1128085220|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128085220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1128085220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1128085220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128085220} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1128085220, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1128085220|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1128085220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1128085220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1128085220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:49,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:49,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:49,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:49,582 INFO L168 Benchmark]: Toolchain (without parser) took 15318.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.6 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -203.3 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,582 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:49,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.80 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:22:49,584 INFO L168 Benchmark]: Boogie Preprocessor took 61.95 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,584 INFO L168 Benchmark]: RCFGBuilder took 714.51 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,585 INFO L168 Benchmark]: TraceAbstraction took 13617.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.5 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,586 INFO L168 Benchmark]: Witness Printer took 111.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:49,589 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.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 743.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.80 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. * Boogie Preprocessor took 61.95 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 714.51 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13617.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.5 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. * Witness Printer took 111.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 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_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=1, 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, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 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, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1823 SDtfs, 2591 SDslu, 4590 SDs, 0 SdLazy, 2367 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6812occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3852 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 114366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...