/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:52,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:52,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:52,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:52,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:52,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:52,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:52,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:52,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:52,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:52,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:52,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:52,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:52,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:52,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:52,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:52,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:52,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:52,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:52,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:52,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:52,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:52,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:52,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:52,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:52,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:52,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:52,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:52,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:52,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:52,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:52,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:52,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:52,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:52,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:52,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:52,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:52,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:52,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:52,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:52,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:52,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:31:52,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:52,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:52,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:52,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:52,132 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:52,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:52,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:52,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:52,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:52,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:52,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:52,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:52,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:52,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:52,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:52,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:52,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:52,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:52,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:52,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:52,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:52,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:52,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:52,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:52,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:52,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-18 13:31:52,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f54b3f06/e73a34e4d27c4d5c961da20863ac6c1d/FLAGe1feec958 [2019-12-18 13:31:53,071 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:53,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-18 13:31:53,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f54b3f06/e73a34e4d27c4d5c961da20863ac6c1d/FLAGe1feec958 [2019-12-18 13:31:53,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f54b3f06/e73a34e4d27c4d5c961da20863ac6c1d [2019-12-18 13:31:53,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:53,388 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:53,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:53,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:53,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:53,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:53" (1/1) ... [2019-12-18 13:31:53,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba4330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:53, skipping insertion in model container [2019-12-18 13:31:53,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:53" (1/1) ... [2019-12-18 13:31:53,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:53,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:53,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:54,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:54,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:54,152 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:54,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54 WrapperNode [2019-12-18 13:31:54,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:54,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:54,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:54,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:54,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:54,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:54,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:54,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:54,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (1/1) ... [2019-12-18 13:31:54,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:54,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:54,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:54,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:54,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (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-12-18 13:31:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:54,351 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:31:55,127 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:55,128 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:55,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:55 BoogieIcfgContainer [2019-12-18 13:31:55,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:55,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:55,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:55,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:55,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:53" (1/3) ... [2019-12-18 13:31:55,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a32dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:55, skipping insertion in model container [2019-12-18 13:31:55,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:54" (2/3) ... [2019-12-18 13:31:55,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a32dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:55, skipping insertion in model container [2019-12-18 13:31:55,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:55" (3/3) ... [2019-12-18 13:31:55,140 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-18 13:31:55,150 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:55,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:55,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:55,160 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:55,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,199 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,201 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,201 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,210 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,210 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,210 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:55,249 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:55,284 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:55,284 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:55,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:55,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:55,285 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:55,285 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:55,285 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:55,285 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:55,303 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 13:31:55,305 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:55,419 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:55,419 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:55,441 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 13:31:55,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 13:31:55,531 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 13:31:55,531 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:55,543 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 13:31:55,562 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 13:31:55,563 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:32:00,344 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 13:32:00,700 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:32:00,840 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:32:00,863 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-18 13:32:00,863 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 13:32:00,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-18 13:32:01,723 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 13:32:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 13:32:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:32:01,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:01,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:01,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 13:32:01,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:01,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507674040] [2019-12-18 13:32:01,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:02,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507674040] [2019-12-18 13:32:02,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:02,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:32:02,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483273180] [2019-12-18 13:32:02,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:02,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:02,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:02,046 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 13:32:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:02,489 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-18 13:32:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:02,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:32:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:02,706 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 13:32:02,707 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 13:32:02,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 13:32:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 13:32:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 13:32:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-18 13:32:04,101 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-18 13:32:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:04,102 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-18 13:32:04,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-18 13:32:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:32:04,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:04,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:04,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 13:32:04,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:04,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229478343] [2019-12-18 13:32:04,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:04,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229478343] [2019-12-18 13:32:04,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:04,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:04,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578152262] [2019-12-18 13:32:04,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:04,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:04,270 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-18 13:32:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:04,806 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-18 13:32:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:04,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:32:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:04,890 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 13:32:04,891 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 13:32:04,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 13:32:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 13:32:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 13:32:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-18 13:32:05,826 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-18 13:32:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:05,827 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-18 13:32:05,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-18 13:32:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:32:05,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:05,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:05,831 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 13:32:05,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:05,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646143550] [2019-12-18 13:32:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646143550] [2019-12-18 13:32:05,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:05,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055333199] [2019-12-18 13:32:05,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:05,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:05,922 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-18 13:32:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:06,773 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-18 13:32:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:06,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:32:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:06,896 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 13:32:06,896 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 13:32:06,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 13:32:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-18 13:32:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 13:32:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-18 13:32:09,004 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-18 13:32:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:09,005 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-18 13:32:09,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-18 13:32:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:32:09,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:09,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:09,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 13:32:09,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:09,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356265599] [2019-12-18 13:32:09,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:09,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356265599] [2019-12-18 13:32:09,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:09,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:09,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380303157] [2019-12-18 13:32:09,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:09,135 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 4 states. [2019-12-18 13:32:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:09,246 INFO L93 Difference]: Finished difference Result 13191 states and 41157 transitions. [2019-12-18 13:32:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:09,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 13:32:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:09,300 INFO L225 Difference]: With dead ends: 13191 [2019-12-18 13:32:09,300 INFO L226 Difference]: Without dead ends: 12661 [2019-12-18 13:32:09,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12661 states. [2019-12-18 13:32:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12661 to 12661. [2019-12-18 13:32:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-12-18 13:32:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 39651 transitions. [2019-12-18 13:32:09,649 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 39651 transitions. Word has length 19 [2019-12-18 13:32:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:09,650 INFO L462 AbstractCegarLoop]: Abstraction has 12661 states and 39651 transitions. [2019-12-18 13:32:09,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 39651 transitions. [2019-12-18 13:32:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 13:32:09,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:09,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:09,658 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-18 13:32:09,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:09,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351800583] [2019-12-18 13:32:09,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:09,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-12-18 13:32:09,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351800583] [2019-12-18 13:32:09,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:09,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:09,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141543159] [2019-12-18 13:32:09,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:09,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:09,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:09,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:09,761 INFO L87 Difference]: Start difference. First operand 12661 states and 39651 transitions. Second operand 5 states. [2019-12-18 13:32:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:09,815 INFO L93 Difference]: Finished difference Result 2119 states and 5073 transitions. [2019-12-18 13:32:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:09,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 13:32:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:09,820 INFO L225 Difference]: With dead ends: 2119 [2019-12-18 13:32:09,821 INFO L226 Difference]: Without dead ends: 1810 [2019-12-18 13:32:09,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-12-18 13:32:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2019-12-18 13:32:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-12-18 13:32:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 4212 transitions. [2019-12-18 13:32:09,850 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 4212 transitions. Word has length 20 [2019-12-18 13:32:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:09,851 INFO L462 AbstractCegarLoop]: Abstraction has 1810 states and 4212 transitions. [2019-12-18 13:32:09,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 4212 transitions. [2019-12-18 13:32:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:32:09,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:09,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:09,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -714307485, now seen corresponding path program 1 times [2019-12-18 13:32:09,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:09,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382245851] [2019-12-18 13:32:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:09,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382245851] [2019-12-18 13:32:09,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:09,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:09,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373222753] [2019-12-18 13:32:09,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:09,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:09,969 INFO L87 Difference]: Start difference. First operand 1810 states and 4212 transitions. Second operand 5 states. [2019-12-18 13:32:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:10,408 INFO L93 Difference]: Finished difference Result 2214 states and 5003 transitions. [2019-12-18 13:32:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:32:10,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:32:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:10,415 INFO L225 Difference]: With dead ends: 2214 [2019-12-18 13:32:10,415 INFO L226 Difference]: Without dead ends: 2214 [2019-12-18 13:32:10,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-12-18 13:32:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2027. [2019-12-18 13:32:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-12-18 13:32:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4646 transitions. [2019-12-18 13:32:10,450 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4646 transitions. Word has length 26 [2019-12-18 13:32:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:10,451 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4646 transitions. [2019-12-18 13:32:10,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4646 transitions. [2019-12-18 13:32:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:10,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:10,455 INFO L411 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] [2019-12-18 13:32:10,456 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-18 13:32:10,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:10,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953081107] [2019-12-18 13:32:10,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:10,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953081107] [2019-12-18 13:32:10,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:10,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:10,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38433718] [2019-12-18 13:32:10,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:10,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:10,649 INFO L87 Difference]: Start difference. First operand 2027 states and 4646 transitions. Second operand 7 states. [2019-12-18 13:32:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:11,104 INFO L93 Difference]: Finished difference Result 2515 states and 5603 transitions. [2019-12-18 13:32:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:32:11,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 13:32:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:11,111 INFO L225 Difference]: With dead ends: 2515 [2019-12-18 13:32:11,111 INFO L226 Difference]: Without dead ends: 2513 [2019-12-18 13:32:11,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-12-18 13:32:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2212. [2019-12-18 13:32:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-12-18 13:32:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 5015 transitions. [2019-12-18 13:32:11,148 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 5015 transitions. Word has length 40 [2019-12-18 13:32:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:11,149 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 5015 transitions. [2019-12-18 13:32:11,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 5015 transitions. [2019-12-18 13:32:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:32:11,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:11,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:11,154 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 128435677, now seen corresponding path program 1 times [2019-12-18 13:32:11,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:11,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016907239] [2019-12-18 13:32:11,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:11,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016907239] [2019-12-18 13:32:11,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:11,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:11,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134809851] [2019-12-18 13:32:11,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:11,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:11,211 INFO L87 Difference]: Start difference. First operand 2212 states and 5015 transitions. Second operand 3 states. [2019-12-18 13:32:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:11,267 INFO L93 Difference]: Finished difference Result 2673 states and 6073 transitions. [2019-12-18 13:32:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:11,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 13:32:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:11,274 INFO L225 Difference]: With dead ends: 2673 [2019-12-18 13:32:11,274 INFO L226 Difference]: Without dead ends: 2673 [2019-12-18 13:32:11,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-12-18 13:32:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2403. [2019-12-18 13:32:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-18 13:32:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5508 transitions. [2019-12-18 13:32:11,312 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5508 transitions. Word has length 44 [2019-12-18 13:32:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:11,313 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5508 transitions. [2019-12-18 13:32:11,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5508 transitions. [2019-12-18 13:32:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:32:11,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:11,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:11,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1698133153, now seen corresponding path program 1 times [2019-12-18 13:32:11,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:11,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366239219] [2019-12-18 13:32:11,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:11,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366239219] [2019-12-18 13:32:11,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:11,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:11,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969074440] [2019-12-18 13:32:11,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:11,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:11,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:11,444 INFO L87 Difference]: Start difference. First operand 2403 states and 5508 transitions. Second operand 5 states. [2019-12-18 13:32:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:11,877 INFO L93 Difference]: Finished difference Result 3250 states and 7346 transitions. [2019-12-18 13:32:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:11,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 13:32:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:11,882 INFO L225 Difference]: With dead ends: 3250 [2019-12-18 13:32:11,882 INFO L226 Difference]: Without dead ends: 3250 [2019-12-18 13:32:11,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2019-12-18 13:32:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2977. [2019-12-18 13:32:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-12-18 13:32:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 6800 transitions. [2019-12-18 13:32:11,932 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 6800 transitions. Word has length 44 [2019-12-18 13:32:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:11,932 INFO L462 AbstractCegarLoop]: Abstraction has 2977 states and 6800 transitions. [2019-12-18 13:32:11,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 6800 transitions. [2019-12-18 13:32:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 13:32:11,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:11,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:11,939 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-18 13:32:11,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:11,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037055433] [2019-12-18 13:32:11,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:12,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037055433] [2019-12-18 13:32:12,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:12,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:12,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662842004] [2019-12-18 13:32:12,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:12,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:12,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:12,055 INFO L87 Difference]: Start difference. First operand 2977 states and 6800 transitions. Second operand 6 states. [2019-12-18 13:32:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:12,159 INFO L93 Difference]: Finished difference Result 999 states and 2272 transitions. [2019-12-18 13:32:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:32:12,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 13:32:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:12,161 INFO L225 Difference]: With dead ends: 999 [2019-12-18 13:32:12,162 INFO L226 Difference]: Without dead ends: 929 [2019-12-18 13:32:12,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-18 13:32:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 799. [2019-12-18 13:32:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-18 13:32:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1831 transitions. [2019-12-18 13:32:12,180 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1831 transitions. Word has length 45 [2019-12-18 13:32:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:12,180 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1831 transitions. [2019-12-18 13:32:12,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1831 transitions. [2019-12-18 13:32:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 13:32:12,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:12,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:12,185 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 1 times [2019-12-18 13:32:12,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:12,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122718684] [2019-12-18 13:32:12,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:12,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122718684] [2019-12-18 13:32:12,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:12,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:12,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394888125] [2019-12-18 13:32:12,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:12,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:12,344 INFO L87 Difference]: Start difference. First operand 799 states and 1831 transitions. Second operand 3 states. [2019-12-18 13:32:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:12,404 INFO L93 Difference]: Finished difference Result 799 states and 1830 transitions. [2019-12-18 13:32:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:12,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 13:32:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:12,407 INFO L225 Difference]: With dead ends: 799 [2019-12-18 13:32:12,407 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 13:32:12,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 13:32:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 642. [2019-12-18 13:32:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 13:32:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-18 13:32:12,426 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 55 [2019-12-18 13:32:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:12,427 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-18 13:32:12,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-18 13:32:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:32:12,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:12,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:12,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-18 13:32:12,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:12,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690619856] [2019-12-18 13:32:12,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:12,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690619856] [2019-12-18 13:32:12,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:12,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:12,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463705101] [2019-12-18 13:32:12,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:12,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:12,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:12,603 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-18 13:32:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:12,623 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-18 13:32:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:12,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:32:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:12,625 INFO L225 Difference]: With dead ends: 642 [2019-12-18 13:32:12,625 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 13:32:12,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 13:32:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-18 13:32:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-18 13:32:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-18 13:32:12,642 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-18 13:32:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-18 13:32:12,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-18 13:32:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:12,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:12,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:12,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-18 13:32:12,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:12,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056766850] [2019-12-18 13:32:12,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:13,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056766850] [2019-12-18 13:32:13,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:13,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:32:13,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594663155] [2019-12-18 13:32:13,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:32:13,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:13,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:32:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:13,055 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 12 states. [2019-12-18 13:32:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:13,811 INFO L93 Difference]: Finished difference Result 1230 states and 2440 transitions. [2019-12-18 13:32:13,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:32:13,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:32:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:13,813 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 13:32:13,814 INFO L226 Difference]: Without dead ends: 610 [2019-12-18 13:32:13,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:32:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-18 13:32:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-18 13:32:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-18 13:32:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-18 13:32:13,825 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-18 13:32:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:13,825 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-18 13:32:13,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:32:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-18 13:32:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:13,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:13,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:13,827 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-18 13:32:13,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:13,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35192645] [2019-12-18 13:32:13,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:14,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35192645] [2019-12-18 13:32:14,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:14,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:32:14,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999814954] [2019-12-18 13:32:14,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:32:14,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:32:14,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:32:14,102 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 12 states. [2019-12-18 13:32:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:14,497 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-18 13:32:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:32:14,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 13:32:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:14,499 INFO L225 Difference]: With dead ends: 852 [2019-12-18 13:32:14,499 INFO L226 Difference]: Without dead ends: 822 [2019-12-18 13:32:14,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:32:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-18 13:32:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-18 13:32:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 13:32:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-18 13:32:14,512 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-18 13:32:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:14,513 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-18 13:32:14,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:32:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-18 13:32:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:32:14,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:14,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:14,515 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-18 13:32:14,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:14,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677229822] [2019-12-18 13:32:14,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:32:14,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:32:14,630 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:32:14,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$r_buff0_thd1~0_41 0) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:32:14,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-18 13:32:14,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-18 13:32:14,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~__unbuffered_p2_EAX~0_Out-1382065914 ~z~0_Out-1382065914) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1382065914 0)) (= ~y$r_buff0_thd3~0_In-1382065914 ~y$r_buff1_thd3~0_Out-1382065914) (= ~__unbuffered_p2_EBX~0_Out-1382065914 ~a~0_In-1382065914) (= ~y$r_buff1_thd2~0_Out-1382065914 ~y$r_buff0_thd2~0_In-1382065914) (= ~y$r_buff0_thd1~0_In-1382065914 ~y$r_buff1_thd1~0_Out-1382065914) (= ~y$r_buff1_thd0~0_Out-1382065914 ~y$r_buff0_thd0~0_In-1382065914) (= 1 ~y$r_buff0_thd3~0_Out-1382065914) (= 1 ~z~0_Out-1382065914)) InVars {~a~0=~a~0_In-1382065914, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1382065914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1382065914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382065914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1382065914, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1382065914} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1382065914, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1382065914, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1382065914, ~a~0=~a~0_In-1382065914, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1382065914, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1382065914, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1382065914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1382065914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382065914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1382065914, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1382065914, ~z~0=~z~0_Out-1382065914, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1382065914} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:32:14,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 13:32:14,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1403514903 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1403514903| |P1Thread1of1ForFork0_#t~ite3_Out-1403514903|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1403514903 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite3_Out-1403514903| ~y~0_In-1403514903) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P1Thread1of1ForFork0_#t~ite3_Out-1403514903| ~y$w_buff1~0_In-1403514903) .cse0 (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403514903, ~y$w_buff1~0=~y$w_buff1~0_In-1403514903, ~y~0=~y~0_In-1403514903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403514903} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1403514903, ~y$w_buff1~0=~y$w_buff1~0_In-1403514903, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1403514903|, ~y~0=~y~0_In-1403514903, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1403514903|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1403514903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:32:14,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In154918944 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In154918944 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_Out154918944| ~y$w_buff0_used~0_In154918944) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out154918944|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In154918944, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In154918944} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In154918944, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out154918944|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In154918944} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:32:14,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1967207160 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1967207160 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1967207160 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1967207160 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1967207160 |P2Thread1of1ForFork1_#t~ite12_Out-1967207160|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-1967207160|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1967207160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1967207160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1967207160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1967207160} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1967207160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1967207160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1967207160, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1967207160|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1967207160} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:32:14,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1516238282 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1516238282 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1516238282 ~y$r_buff0_thd3~0_Out1516238282)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out1516238282)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1516238282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1516238282} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1516238282|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1516238282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1516238282} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:32:14,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1240568860 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1240568860 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1240568860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1240568860 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out1240568860| ~y$r_buff1_thd3~0_In1240568860) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out1240568860|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1240568860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1240568860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1240568860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1240568860} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1240568860|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1240568860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1240568860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1240568860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1240568860} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:32:14,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:32:14,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In512898974 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In512898974 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out512898974|) (not .cse1)) (and (= ~y$w_buff0_used~0_In512898974 |P1Thread1of1ForFork0_#t~ite5_Out512898974|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512898974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In512898974} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In512898974, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In512898974, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out512898974|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:32:14,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1553989537 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1553989537 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1553989537 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1553989537 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out1553989537|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1553989537 |P1Thread1of1ForFork0_#t~ite6_Out1553989537|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553989537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553989537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553989537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553989537} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553989537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553989537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553989537, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1553989537|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553989537} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:32:14,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2090594428 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2090594428 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-2090594428|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-2090594428 |P1Thread1of1ForFork0_#t~ite7_Out-2090594428|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090594428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090594428} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090594428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090594428, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-2090594428|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:32:14,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-313837198 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-313837198 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-313837198 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-313837198 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out-313837198| ~y$r_buff1_thd2~0_In-313837198) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite8_Out-313837198| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-313837198, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-313837198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-313837198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313837198} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-313837198, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-313837198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-313837198, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-313837198|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313837198} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:32:14,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:32:14,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:32:14,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1732844543 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1732844543 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite19_Out-1732844543| |ULTIMATE.start_main_#t~ite18_Out-1732844543|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-1732844543| ~y$w_buff1~0_In-1732844543) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite18_Out-1732844543| ~y~0_In-1732844543) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1732844543, ~y~0=~y~0_In-1732844543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732844543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732844543} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1732844543, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1732844543|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1732844543|, ~y~0=~y~0_In-1732844543, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1732844543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1732844543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:32:14,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1692783978 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1692783978 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out1692783978|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1692783978 |ULTIMATE.start_main_#t~ite20_Out1692783978|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1692783978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1692783978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1692783978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1692783978, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1692783978|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:32:14,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-803023642 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-803023642 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-803023642 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-803023642 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-803023642 |ULTIMATE.start_main_#t~ite21_Out-803023642|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-803023642| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-803023642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-803023642, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-803023642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-803023642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-803023642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-803023642, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-803023642|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-803023642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-803023642} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:32:14,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In703730351 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In703730351 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out703730351| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out703730351| ~y$r_buff0_thd0~0_In703730351) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In703730351, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In703730351} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In703730351, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In703730351, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out703730351|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:32:14,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-149969311 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-149969311 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-149969311 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-149969311 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-149969311|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-149969311 |ULTIMATE.start_main_#t~ite23_Out-149969311|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-149969311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149969311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149969311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149969311} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-149969311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-149969311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-149969311, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-149969311|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-149969311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:32:14,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-633242905 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-633242905 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-633242905 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-633242905 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-633242905 256))))) (= |ULTIMATE.start_main_#t~ite29_Out-633242905| ~y$w_buff0~0_In-633242905) (= |ULTIMATE.start_main_#t~ite29_Out-633242905| |ULTIMATE.start_main_#t~ite30_Out-633242905|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite29_In-633242905| |ULTIMATE.start_main_#t~ite29_Out-633242905|) (= |ULTIMATE.start_main_#t~ite30_Out-633242905| ~y$w_buff0~0_In-633242905)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-633242905, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-633242905|, ~y$w_buff0~0=~y$w_buff0~0_In-633242905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-633242905, ~weak$$choice2~0=~weak$$choice2~0_In-633242905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-633242905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-633242905} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-633242905|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-633242905, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-633242905|, ~y$w_buff0~0=~y$w_buff0~0_In-633242905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-633242905, ~weak$$choice2~0=~weak$$choice2~0_In-633242905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-633242905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-633242905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:32:14,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In859990021 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out859990021| ~y$w_buff0_used~0_In859990021) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In859990021| |ULTIMATE.start_main_#t~ite35_Out859990021|)) (and (= |ULTIMATE.start_main_#t~ite36_Out859990021| |ULTIMATE.start_main_#t~ite35_Out859990021|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In859990021 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In859990021 256) 0)) (= (mod ~y$w_buff0_used~0_In859990021 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In859990021 256))))) (= |ULTIMATE.start_main_#t~ite35_Out859990021| ~y$w_buff0_used~0_In859990021) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In859990021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In859990021, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In859990021|, ~weak$$choice2~0=~weak$$choice2~0_In859990021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In859990021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859990021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In859990021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In859990021, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out859990021|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out859990021|, ~weak$$choice2~0=~weak$$choice2~0_In859990021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In859990021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In859990021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:32:14,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1722446938 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_In-1722446938| |ULTIMATE.start_main_#t~ite38_Out-1722446938|) (= |ULTIMATE.start_main_#t~ite39_Out-1722446938| ~y$w_buff1_used~0_In-1722446938) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1722446938 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1722446938 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1722446938 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1722446938 256)))) (= |ULTIMATE.start_main_#t~ite39_Out-1722446938| |ULTIMATE.start_main_#t~ite38_Out-1722446938|) (= |ULTIMATE.start_main_#t~ite38_Out-1722446938| ~y$w_buff1_used~0_In-1722446938) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722446938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722446938, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1722446938|, ~weak$$choice2~0=~weak$$choice2~0_In-1722446938, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722446938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722446938} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722446938, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1722446938|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722446938, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1722446938|, ~weak$$choice2~0=~weak$$choice2~0_In-1722446938, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722446938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722446938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:32:14,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:32:14,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-655863610 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-655863610 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-655863610 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-655863610 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-655863610 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite44_Out-655863610| |ULTIMATE.start_main_#t~ite45_Out-655863610|) (= |ULTIMATE.start_main_#t~ite44_Out-655863610| ~y$r_buff1_thd0~0_In-655863610)) (and (= |ULTIMATE.start_main_#t~ite45_Out-655863610| ~y$r_buff1_thd0~0_In-655863610) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_In-655863610| |ULTIMATE.start_main_#t~ite44_Out-655863610|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-655863610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-655863610, ~weak$$choice2~0=~weak$$choice2~0_In-655863610, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-655863610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-655863610, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-655863610|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-655863610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-655863610, ~weak$$choice2~0=~weak$$choice2~0_In-655863610, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-655863610, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-655863610|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-655863610|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-655863610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:32:14,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:32:14,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:32:14,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:32:14 BasicIcfg [2019-12-18 13:32:14,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:32:14,721 INFO L168 Benchmark]: Toolchain (without parser) took 21333.57 ms. Allocated memory was 137.9 MB in the beginning and 935.3 MB in the end (delta: 797.4 MB). Free memory was 100.2 MB in the beginning and 404.6 MB in the end (delta: -304.4 MB). Peak memory consumption was 493.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,722 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.88 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 154.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.69 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,724 INFO L168 Benchmark]: Boogie Preprocessor took 37.70 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,724 INFO L168 Benchmark]: RCFGBuilder took 860.12 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 102.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,725 INFO L168 Benchmark]: TraceAbstraction took 19588.51 ms. Allocated memory was 200.8 MB in the beginning and 935.3 MB in the end (delta: 734.5 MB). Free memory was 102.1 MB in the beginning and 404.6 MB in the end (delta: -302.6 MB). Peak memory consumption was 432.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:32:14,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.88 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 154.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.69 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.70 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.12 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 102.1 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19588.51 ms. Allocated memory was 200.8 MB in the beginning and 935.3 MB in the end (delta: 734.5 MB). Free memory was 102.1 MB in the beginning and 404.6 MB in the end (delta: -302.6 MB). Peak memory consumption was 432.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1671 SDtfs, 1885 SDslu, 3697 SDs, 0 SdLazy, 2084 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 6370 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 76812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...