./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe033_pso.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/safe033_pso.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 d557fcdf9e422bdd0c5ac00696fcc79c766638d1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:33:31,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:31,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:31,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:31,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:31,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:31,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:31,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:31,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:31,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:31,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:31,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:31,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:31,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:31,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:31,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:31,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:31,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:31,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:31,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:31,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:31,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:31,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:31,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:31,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:31,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:31,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:31,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:31,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:31,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:31,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:31,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:31,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:31,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:31,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:31,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:31,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:31,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:31,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:31,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:31,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:31,983 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:33:31,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:32,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:32,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:32,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:32,005 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:32,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:32,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:32,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:32,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:32,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:32,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:32,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:32,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:32,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:32,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:32,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:32,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:32,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:32,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:32,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:32,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:32,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:32,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:32,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:32,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:32,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:32,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:32,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:32,012 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:32,012 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 -> d557fcdf9e422bdd0c5ac00696fcc79c766638d1 [2019-11-28 18:33:32,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:32,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:32,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:32,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:32,392 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:32,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-11-28 18:33:32,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7762b4a23/af18233357d2470090911063cede02ce/FLAG1b96435fb [2019-11-28 18:33:33,053 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:33,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-11-28 18:33:33,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7762b4a23/af18233357d2470090911063cede02ce/FLAG1b96435fb [2019-11-28 18:33:33,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7762b4a23/af18233357d2470090911063cede02ce [2019-11-28 18:33:33,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:33,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:33,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:33,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:33,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:33,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:33" (1/1) ... [2019-11-28 18:33:33,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a6e3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:33, skipping insertion in model container [2019-11-28 18:33:33,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:33" (1/1) ... [2019-11-28 18:33:33,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:33,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:33,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:33,986 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:34,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:34,113 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:34,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34 WrapperNode [2019-11-28 18:33:34,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:34,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:34,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:34,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:34,124 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:33:34" (1/1) ... [2019-11-28 18:33:34,144 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:33:34" (1/1) ... [2019-11-28 18:33:34,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:34,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:34,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:34,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:34,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:34,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:34,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:34,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:34,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (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:33:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:34,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:34,305 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:33:34,987 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:34,988 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:34,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:34 BoogieIcfgContainer [2019-11-28 18:33:34,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:34,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:34,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:34,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:34,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:33" (1/3) ... [2019-11-28 18:33:35,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501eaa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:34, skipping insertion in model container [2019-11-28 18:33:35,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34" (2/3) ... [2019-11-28 18:33:35,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501eaa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:35, skipping insertion in model container [2019-11-28 18:33:35,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:34" (3/3) ... [2019-11-28 18:33:35,005 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-11-28 18:33:35,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:35,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:35,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:35,034 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:35,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:35,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:33:35,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:35,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:35,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:35,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:35,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:35,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:35,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:35,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:35,174 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-11-28 18:33:35,176 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:35,268 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:35,268 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:35,287 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:35,309 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:35,383 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:35,384 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:35,390 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:35,405 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:33:35,406 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:39,625 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:33:39,738 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:33:39,887 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-11-28 18:33:39,887 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-11-28 18:33:39,892 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-11-28 18:33:40,339 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-11-28 18:33:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-11-28 18:33:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:33:40,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:40,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:33:40,351 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:33:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-11-28 18:33:40,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:40,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422538720] [2019-11-28 18:33:40,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:40,772 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:33:40,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422538720] [2019-11-28 18:33:40,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:40,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:40,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892112152] [2019-11-28 18:33:40,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:40,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:40,815 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-11-28 18:33:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,165 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-11-28 18:33:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:33:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,267 INFO L225 Difference]: With dead ends: 6240 [2019-11-28 18:33:41,274 INFO L226 Difference]: Without dead ends: 5850 [2019-11-28 18:33:41,281 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:33:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-11-28 18:33:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-11-28 18:33:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-11-28 18:33:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-11-28 18:33:41,705 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-11-28 18:33:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-11-28 18:33:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-11-28 18:33:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:33:41,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:41,712 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:33:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-11-28 18:33:41,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918542887] [2019-11-28 18:33:41,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,803 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:33:41,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918542887] [2019-11-28 18:33:41,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:41,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132226722] [2019-11-28 18:33:41,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:41,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:41,806 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-11-28 18:33:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,830 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-11-28 18:33:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:41,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:33:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,839 INFO L225 Difference]: With dead ends: 1185 [2019-11-28 18:33:41,839 INFO L226 Difference]: Without dead ends: 1185 [2019-11-28 18:33:41,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-28 18:33:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-11-28 18:33:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-28 18:33:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-11-28 18:33:41,874 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-11-28 18:33:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,874 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-11-28 18:33:41,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-11-28 18:33:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:41,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:41,877 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:33:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-11-28 18:33:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442174474] [2019-11-28 18:33:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,921 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:33:41,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442174474] [2019-11-28 18:33:41,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:41,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934335265] [2019-11-28 18:33:41,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:41,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:41,923 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-11-28 18:33:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,986 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-11-28 18:33:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:41,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:33:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,997 INFO L225 Difference]: With dead ends: 1756 [2019-11-28 18:33:41,998 INFO L226 Difference]: Without dead ends: 1756 [2019-11-28 18:33:41,998 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:33:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-11-28 18:33:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-11-28 18:33:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-11-28 18:33:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-11-28 18:33:42,042 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-11-28 18:33:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,042 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-11-28 18:33:42,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-11-28 18:33:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:42,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:42,044 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:33:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-11-28 18:33:42,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694220141] [2019-11-28 18:33:42,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,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:33:42,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694220141] [2019-11-28 18:33:42,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:42,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033553855] [2019-11-28 18:33:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:42,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:42,177 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-11-28 18:33:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,335 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-11-28 18:33:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:42,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,346 INFO L225 Difference]: With dead ends: 1703 [2019-11-28 18:33:42,347 INFO L226 Difference]: Without dead ends: 1703 [2019-11-28 18:33:42,347 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:33:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-11-28 18:33:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-11-28 18:33:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-28 18:33:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-11-28 18:33:42,392 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-11-28 18:33:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,393 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-11-28 18:33:42,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-11-28 18:33:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:42,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:42,395 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:33:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-11-28 18:33:42,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921129863] [2019-11-28 18:33:42,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,466 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:33:42,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921129863] [2019-11-28 18:33:42,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:42,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007249329] [2019-11-28 18:33:42,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:42,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:42,468 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-11-28 18:33:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,640 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-11-28 18:33:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:42,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,652 INFO L225 Difference]: With dead ends: 1972 [2019-11-28 18:33:42,653 INFO L226 Difference]: Without dead ends: 1972 [2019-11-28 18:33:42,653 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:33:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-11-28 18:33:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-11-28 18:33:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-11-28 18:33:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-11-28 18:33:42,698 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-11-28 18:33:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,699 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-11-28 18:33:42,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-11-28 18:33:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:42,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,702 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:33:42,702 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:33:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-11-28 18:33:42,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704853646] [2019-11-28 18:33:42,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,759 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:33:42,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704853646] [2019-11-28 18:33:42,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:42,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10924978] [2019-11-28 18:33:42,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:42,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:42,762 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-11-28 18:33:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,787 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-11-28 18:33:42,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:33:42,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-28 18:33:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,793 INFO L225 Difference]: With dead ends: 772 [2019-11-28 18:33:42,793 INFO L226 Difference]: Without dead ends: 772 [2019-11-28 18:33:42,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-11-28 18:33:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-11-28 18:33:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-28 18:33:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-11-28 18:33:42,811 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-11-28 18:33:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,811 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-11-28 18:33:42,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-11-28 18:33:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:42,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,814 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:33:42,815 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:33:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-11-28 18:33:42,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479702398] [2019-11-28 18:33:42,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,912 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:33:42,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479702398] [2019-11-28 18:33:42,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:42,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578510584] [2019-11-28 18:33:42,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:42,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:42,915 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 5 states. [2019-11-28 18:33:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:43,288 INFO L93 Difference]: Finished difference Result 1061 states and 2336 transitions. [2019-11-28 18:33:43,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:43,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-28 18:33:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:43,295 INFO L225 Difference]: With dead ends: 1061 [2019-11-28 18:33:43,296 INFO L226 Difference]: Without dead ends: 1061 [2019-11-28 18:33:43,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-28 18:33:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 901. [2019-11-28 18:33:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-11-28 18:33:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2017 transitions. [2019-11-28 18:33:43,326 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2017 transitions. Word has length 41 [2019-11-28 18:33:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:43,326 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 2017 transitions. [2019-11-28 18:33:43,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2017 transitions. [2019-11-28 18:33:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:43,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:43,330 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:33:43,330 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:33:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 2 times [2019-11-28 18:33:43,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:43,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740400130] [2019-11-28 18:33:43,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:43,501 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:33:43,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740400130] [2019-11-28 18:33:43,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:43,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:43,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118103629] [2019-11-28 18:33:43,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:33:43,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:33:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:43,503 INFO L87 Difference]: Start difference. First operand 901 states and 2017 transitions. Second operand 6 states. [2019-11-28 18:33:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:43,722 INFO L93 Difference]: Finished difference Result 1124 states and 2443 transitions. [2019-11-28 18:33:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:43,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:33:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:43,738 INFO L225 Difference]: With dead ends: 1124 [2019-11-28 18:33:43,738 INFO L226 Difference]: Without dead ends: 1124 [2019-11-28 18:33:43,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:33:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-11-28 18:33:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 935. [2019-11-28 18:33:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-11-28 18:33:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2085 transitions. [2019-11-28 18:33:43,767 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2085 transitions. Word has length 41 [2019-11-28 18:33:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:43,769 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2085 transitions. [2019-11-28 18:33:43,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:33:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2085 transitions. [2019-11-28 18:33:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:43,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:43,772 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:33:43,772 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:33:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2091375240, now seen corresponding path program 3 times [2019-11-28 18:33:43,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:43,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334669903] [2019-11-28 18:33:43,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:44,015 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:33:44,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334669903] [2019-11-28 18:33:44,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:44,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:33:44,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801939112] [2019-11-28 18:33:44,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:33:44,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:44,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:33:44,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:33:44,018 INFO L87 Difference]: Start difference. First operand 935 states and 2085 transitions. Second operand 9 states. [2019-11-28 18:33:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:44,851 INFO L93 Difference]: Finished difference Result 2079 states and 4637 transitions. [2019-11-28 18:33:44,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:33:44,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 18:33:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:44,863 INFO L225 Difference]: With dead ends: 2079 [2019-11-28 18:33:44,863 INFO L226 Difference]: Without dead ends: 1811 [2019-11-28 18:33:44,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:33:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-28 18:33:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 943. [2019-11-28 18:33:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-28 18:33:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2100 transitions. [2019-11-28 18:33:44,892 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2100 transitions. Word has length 41 [2019-11-28 18:33:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:44,892 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 2100 transitions. [2019-11-28 18:33:44,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:33:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2100 transitions. [2019-11-28 18:33:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:44,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:44,896 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:33:44,896 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:33:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1380359352, now seen corresponding path program 4 times [2019-11-28 18:33:44,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:44,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781782355] [2019-11-28 18:33:44,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,016 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:33:45,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781782355] [2019-11-28 18:33:45,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:33:45,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266529146] [2019-11-28 18:33:45,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:33:45,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:33:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:33:45,020 INFO L87 Difference]: Start difference. First operand 943 states and 2100 transitions. Second operand 8 states. [2019-11-28 18:33:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,560 INFO L93 Difference]: Finished difference Result 1210 states and 2560 transitions. [2019-11-28 18:33:45,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:33:45,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-28 18:33:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,566 INFO L225 Difference]: With dead ends: 1210 [2019-11-28 18:33:45,567 INFO L226 Difference]: Without dead ends: 1210 [2019-11-28 18:33:45,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:33:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-28 18:33:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 825. [2019-11-28 18:33:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-11-28 18:33:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1799 transitions. [2019-11-28 18:33:45,590 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1799 transitions. Word has length 41 [2019-11-28 18:33:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,591 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1799 transitions. [2019-11-28 18:33:45,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:33:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1799 transitions. [2019-11-28 18:33:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:45,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,594 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:33:45,594 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:33:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1798927574, now seen corresponding path program 5 times [2019-11-28 18:33:45,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336353887] [2019-11-28 18:33:45,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,693 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:33:45,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336353887] [2019-11-28 18:33:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498930767] [2019-11-28 18:33:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:45,695 INFO L87 Difference]: Start difference. First operand 825 states and 1799 transitions. Second operand 3 states. [2019-11-28 18:33:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,709 INFO L93 Difference]: Finished difference Result 825 states and 1797 transitions. [2019-11-28 18:33:45,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:45,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:33:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,713 INFO L225 Difference]: With dead ends: 825 [2019-11-28 18:33:45,713 INFO L226 Difference]: Without dead ends: 825 [2019-11-28 18:33:45,714 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:33:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-28 18:33:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 690. [2019-11-28 18:33:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-11-28 18:33:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1539 transitions. [2019-11-28 18:33:45,731 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1539 transitions. Word has length 41 [2019-11-28 18:33:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,731 INFO L462 AbstractCegarLoop]: Abstraction has 690 states and 1539 transitions. [2019-11-28 18:33:45,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1539 transitions. [2019-11-28 18:33:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:45,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,734 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:33:45,734 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:33:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 1 times [2019-11-28 18:33:45,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707043736] [2019-11-28 18:33:45,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,805 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:33:45,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707043736] [2019-11-28 18:33:45,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:45,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765500476] [2019-11-28 18:33:45,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:45,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:45,808 INFO L87 Difference]: Start difference. First operand 690 states and 1539 transitions. Second operand 4 states. [2019-11-28 18:33:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,827 INFO L93 Difference]: Finished difference Result 1147 states and 2563 transitions. [2019-11-28 18:33:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:33:45,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 18:33:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,830 INFO L225 Difference]: With dead ends: 1147 [2019-11-28 18:33:45,830 INFO L226 Difference]: Without dead ends: 475 [2019-11-28 18:33:45,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-28 18:33:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2019-11-28 18:33:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-28 18:33:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1052 transitions. [2019-11-28 18:33:45,841 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1052 transitions. Word has length 42 [2019-11-28 18:33:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,842 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1052 transitions. [2019-11-28 18:33:45,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1052 transitions. [2019-11-28 18:33:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:45,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,844 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:33:45,844 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:33:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 2 times [2019-11-28 18:33:45,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587486016] [2019-11-28 18:33:45,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:46,181 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:33:46,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587486016] [2019-11-28 18:33:46,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:46,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:33:46,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123323277] [2019-11-28 18:33:46,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:33:46,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:33:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:33:46,185 INFO L87 Difference]: Start difference. First operand 475 states and 1052 transitions. Second operand 12 states. [2019-11-28 18:33:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:47,547 INFO L93 Difference]: Finished difference Result 770 states and 1642 transitions. [2019-11-28 18:33:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:33:47,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-28 18:33:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:47,550 INFO L225 Difference]: With dead ends: 770 [2019-11-28 18:33:47,551 INFO L226 Difference]: Without dead ends: 574 [2019-11-28 18:33:47,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-11-28 18:33:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-28 18:33:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 550. [2019-11-28 18:33:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-11-28 18:33:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1205 transitions. [2019-11-28 18:33:47,563 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1205 transitions. Word has length 42 [2019-11-28 18:33:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,564 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1205 transitions. [2019-11-28 18:33:47,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:33:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1205 transitions. [2019-11-28 18:33:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:47,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,567 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:33:47,567 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:33:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash -622479619, now seen corresponding path program 1 times [2019-11-28 18:33:47,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784240268] [2019-11-28 18:33:47,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:47,603 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:33:47,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784240268] [2019-11-28 18:33:47,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:47,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:47,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619232128] [2019-11-28 18:33:47,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:47,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:47,605 INFO L87 Difference]: Start difference. First operand 550 states and 1205 transitions. Second operand 3 states. [2019-11-28 18:33:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:47,640 INFO L93 Difference]: Finished difference Result 635 states and 1282 transitions. [2019-11-28 18:33:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:47,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 18:33:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:47,642 INFO L225 Difference]: With dead ends: 635 [2019-11-28 18:33:47,642 INFO L226 Difference]: Without dead ends: 635 [2019-11-28 18:33:47,643 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:33:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-11-28 18:33:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 527. [2019-11-28 18:33:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-28 18:33:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1090 transitions. [2019-11-28 18:33:47,654 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1090 transitions. Word has length 42 [2019-11-28 18:33:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,655 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1090 transitions. [2019-11-28 18:33:47,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1090 transitions. [2019-11-28 18:33:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:47,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,657 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:33:47,657 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:33:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 785501187, now seen corresponding path program 3 times [2019-11-28 18:33:47,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973197431] [2019-11-28 18:33:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:47,723 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:33:47,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973197431] [2019-11-28 18:33:47,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:47,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:47,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692582701] [2019-11-28 18:33:47,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:33:47,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:33:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:47,726 INFO L87 Difference]: Start difference. First operand 527 states and 1090 transitions. Second operand 6 states. [2019-11-28 18:33:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:47,857 INFO L93 Difference]: Finished difference Result 803 states and 1626 transitions. [2019-11-28 18:33:47,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:33:47,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:33:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:47,860 INFO L225 Difference]: With dead ends: 803 [2019-11-28 18:33:47,860 INFO L226 Difference]: Without dead ends: 549 [2019-11-28 18:33:47,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:33:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-11-28 18:33:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 507. [2019-11-28 18:33:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-28 18:33:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1020 transitions. [2019-11-28 18:33:47,874 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1020 transitions. Word has length 42 [2019-11-28 18:33:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,875 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1020 transitions. [2019-11-28 18:33:47,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:33:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1020 transitions. [2019-11-28 18:33:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:47,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,877 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:33:47,877 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 4 times [2019-11-28 18:33:47,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336542087] [2019-11-28 18:33:47,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:47,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:33:47,976 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:33:47,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff0_thd2~0_163) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2567~0.base_24| 4)) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24| 1)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_25|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_~#t2567~0.base=|v_ULTIMATE.start_main_~#t2567~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2567~0.offset=|v_ULTIMATE.start_main_~#t2567~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2567~0.base, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2568~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2567~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:47,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2568~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11|) |v_ULTIMATE.start_main_~#t2568~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t2568~0.offset_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2568~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2568~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2568~0.offset] because there is no mapped edge [2019-11-28 18:33:47,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:47,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1227226045 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1227226045| |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|) (= ~x$w_buff0~0_In-1227226045 |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1227226045 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1227226045 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1227226045 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-1227226045 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite9_Out-1227226045| ~x$w_buff0~0_In-1227226045) (= |P0Thread1of1ForFork1_#t~ite8_In-1227226045| |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1227226045, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1227226045, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1227226045|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227226045, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1227226045, ~weak$$choice2~0=~weak$$choice2~0_In-1227226045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227226045} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1227226045, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1227226045, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1227226045|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1227226045|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227226045, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1227226045, ~weak$$choice2~0=~weak$$choice2~0_In-1227226045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227226045} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:47,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:47,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:47,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1080980967 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1080980967 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1080980967| ~x$w_buff0_used~0_In1080980967)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1080980967| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1080980967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080980967} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1080980967, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1080980967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080980967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:47,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In200591069 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In200591069 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In200591069 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In200591069 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In200591069 |P1Thread1of1ForFork0_#t~ite29_Out200591069|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out200591069|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In200591069, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200591069, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200591069, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200591069} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In200591069, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200591069, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200591069, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out200591069|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200591069} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1888175248 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1888175248 256))) (.cse2 (= ~x$r_buff0_thd2~0_In-1888175248 ~x$r_buff0_thd2~0_Out-1888175248))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1888175248)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1888175248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888175248} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1888175248|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1888175248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888175248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-438789660 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-438789660 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-438789660 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-438789660 256)))) (or (and (= ~x$r_buff1_thd2~0_In-438789660 |P1Thread1of1ForFork0_#t~ite31_Out-438789660|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-438789660|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-438789660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-438789660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-438789660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438789660} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-438789660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438789660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-438789660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-438789660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438789660} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:47,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1411816203 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite34_Out1411816203| |ULTIMATE.start_main_#t~ite35_Out1411816203|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1411816203 256)))) (or (and (= ~x~0_In1411816203 |ULTIMATE.start_main_#t~ite34_Out1411816203|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In1411816203 |ULTIMATE.start_main_#t~ite34_Out1411816203|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1411816203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1411816203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1411816203, ~x~0=~x~0_In1411816203} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1411816203, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1411816203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1411816203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1411816203, ~x~0=~x~0_In1411816203, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1411816203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:47,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In714000496 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In714000496 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out714000496|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In714000496 |ULTIMATE.start_main_#t~ite36_Out714000496|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In714000496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In714000496} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In714000496, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out714000496|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In714000496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:47,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-452071597 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-452071597 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-452071597 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-452071597 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-452071597 |ULTIMATE.start_main_#t~ite37_Out-452071597|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-452071597|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-452071597, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452071597, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-452071597, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452071597} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-452071597, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452071597, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-452071597|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-452071597, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452071597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:47,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-126900364 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-126900364 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-126900364 |ULTIMATE.start_main_#t~ite38_Out-126900364|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-126900364|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-126900364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126900364} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-126900364, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-126900364|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126900364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:47,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2033682190 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2033682190 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2033682190 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2033682190 256)))) (or (and (= ~x$r_buff1_thd0~0_In-2033682190 |ULTIMATE.start_main_#t~ite39_Out-2033682190|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2033682190|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033682190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033682190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2033682190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033682190} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033682190, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2033682190|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033682190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2033682190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033682190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:47,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:48,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:33:48 BasicIcfg [2019-11-28 18:33:48,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:33:48,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:33:48,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:33:48,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:33:48,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:34" (3/4) ... [2019-11-28 18:33:48,063 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:33:48,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff0_thd2~0_163) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2567~0.base_24| 4)) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24| 1)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_25|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_~#t2567~0.base=|v_ULTIMATE.start_main_~#t2567~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2567~0.offset=|v_ULTIMATE.start_main_~#t2567~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2567~0.base, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2568~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2567~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:48,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2568~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11|) |v_ULTIMATE.start_main_~#t2568~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t2568~0.offset_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2568~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2568~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2568~0.offset] because there is no mapped edge [2019-11-28 18:33:48,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:48,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1227226045 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1227226045| |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|) (= ~x$w_buff0~0_In-1227226045 |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1227226045 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1227226045 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1227226045 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-1227226045 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite9_Out-1227226045| ~x$w_buff0~0_In-1227226045) (= |P0Thread1of1ForFork1_#t~ite8_In-1227226045| |P0Thread1of1ForFork1_#t~ite8_Out-1227226045|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1227226045, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1227226045, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1227226045|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227226045, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1227226045, ~weak$$choice2~0=~weak$$choice2~0_In-1227226045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227226045} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1227226045, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1227226045, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1227226045|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1227226045|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227226045, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1227226045, ~weak$$choice2~0=~weak$$choice2~0_In-1227226045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227226045} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:48,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:48,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:48,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1080980967 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1080980967 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1080980967| ~x$w_buff0_used~0_In1080980967)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1080980967| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1080980967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080980967} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1080980967, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1080980967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080980967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:48,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In200591069 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In200591069 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In200591069 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In200591069 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In200591069 |P1Thread1of1ForFork0_#t~ite29_Out200591069|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out200591069|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In200591069, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200591069, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200591069, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200591069} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In200591069, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200591069, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200591069, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out200591069|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200591069} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:48,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1888175248 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1888175248 256))) (.cse2 (= ~x$r_buff0_thd2~0_In-1888175248 ~x$r_buff0_thd2~0_Out-1888175248))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1888175248)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1888175248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888175248} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1888175248|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1888175248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1888175248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:48,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-438789660 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-438789660 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-438789660 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-438789660 256)))) (or (and (= ~x$r_buff1_thd2~0_In-438789660 |P1Thread1of1ForFork0_#t~ite31_Out-438789660|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-438789660|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-438789660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-438789660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-438789660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438789660} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-438789660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-438789660, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-438789660, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-438789660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438789660} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:48,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:48,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:48,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1411816203 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite34_Out1411816203| |ULTIMATE.start_main_#t~ite35_Out1411816203|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1411816203 256)))) (or (and (= ~x~0_In1411816203 |ULTIMATE.start_main_#t~ite34_Out1411816203|) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In1411816203 |ULTIMATE.start_main_#t~ite34_Out1411816203|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1411816203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1411816203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1411816203, ~x~0=~x~0_In1411816203} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1411816203, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1411816203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1411816203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1411816203, ~x~0=~x~0_In1411816203, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1411816203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:48,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In714000496 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In714000496 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out714000496|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In714000496 |ULTIMATE.start_main_#t~ite36_Out714000496|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In714000496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In714000496} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In714000496, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out714000496|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In714000496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:48,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-452071597 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-452071597 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-452071597 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-452071597 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-452071597 |ULTIMATE.start_main_#t~ite37_Out-452071597|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-452071597|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-452071597, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452071597, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-452071597, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452071597} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-452071597, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-452071597, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-452071597|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-452071597, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452071597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:48,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-126900364 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-126900364 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-126900364 |ULTIMATE.start_main_#t~ite38_Out-126900364|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-126900364|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-126900364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126900364} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-126900364, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-126900364|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-126900364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:48,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2033682190 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2033682190 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2033682190 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2033682190 256)))) (or (and (= ~x$r_buff1_thd0~0_In-2033682190 |ULTIMATE.start_main_#t~ite39_Out-2033682190|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-2033682190|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033682190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033682190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2033682190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033682190} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033682190, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2033682190|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033682190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2033682190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033682190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:48,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:48,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:33:48,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:33:48,179 INFO L168 Benchmark]: Toolchain (without parser) took 14878.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.3 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -298.7 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,182 INFO L168 Benchmark]: CDTParser took 1.11 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:33:48,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:33:48,187 INFO L168 Benchmark]: Boogie Preprocessor took 46.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,188 INFO L168 Benchmark]: RCFGBuilder took 766.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,189 INFO L168 Benchmark]: TraceAbstraction took 13064.40 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -240.0 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,190 INFO L168 Benchmark]: Witness Printer took 118.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:48,196 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 814.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 766.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13064.40 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -240.0 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * Witness Printer took 118.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1530 SDtfs, 1480 SDslu, 3190 SDs, 0 SdLazy, 2789 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 2972 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 71786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...