/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/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:45:45,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:45:45,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:45:45,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:45:45,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:45:45,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:45:45,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:45:45,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:45:45,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:45:45,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:45:45,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:45:45,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:45:45,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:45:45,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:45:45,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:45:45,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:45:45,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:45:45,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:45:45,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:45:45,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:45:45,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:45:45,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:45:45,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:45:45,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:45:45,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:45:45,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:45:45,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:45:45,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:45:45,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:45:45,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:45:45,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:45:45,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:45:45,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:45:45,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:45:45,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:45:45,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:45:45,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:45:45,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:45:45,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:45:45,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:45:45,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:45:45,922 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-26 22:45:45,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:45:45,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:45:45,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:45:45,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:45:45,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:45:45,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:45:45,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:45:45,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:45:45,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:45:45,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:45:45,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:45:45,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:45:45,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:45:45,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:45:45,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:45:45,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:45:45,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:45:45,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:45:45,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:45:45,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:45:45,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:45:45,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:45:45,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:45:45,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:45:45,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:45:45,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:45:45,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:45:45,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:45:45,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:45:45,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:45:46,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:45:46,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:45:46,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:45:46,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:45:46,283 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:45:46,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-26 22:45:46,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20418909/83df3bfaf0ae4286a6f9ff066194d7c3/FLAG3fb4c71bc [2019-12-26 22:45:46,952 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:45:46,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2019-12-26 22:45:46,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20418909/83df3bfaf0ae4286a6f9ff066194d7c3/FLAG3fb4c71bc [2019-12-26 22:45:47,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20418909/83df3bfaf0ae4286a6f9ff066194d7c3 [2019-12-26 22:45:47,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:45:47,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:45:47,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:45:47,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:45:47,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:45:47,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:45:47" (1/1) ... [2019-12-26 22:45:47,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edc5a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:47, skipping insertion in model container [2019-12-26 22:45:47,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:45:47" (1/1) ... [2019-12-26 22:45:47,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:45:47,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:45:47,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:45:47,863 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:45:47,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:45:48,002 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:45:48,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48 WrapperNode [2019-12-26 22:45:48,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:45:48,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:45:48,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:45:48,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:45:48,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:45:48,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:45:48,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:45:48,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:45:48,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (1/1) ... [2019-12-26 22:45:48,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:45:48,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:45:48,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:45:48,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:45:48,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (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-26 22:45:48,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:45:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:45:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:45:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:45:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:45:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:45:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:45:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:45:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:45:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:45:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:45:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:45:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:45:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:45:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:45:48,180 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:45:48,991 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:45:48,992 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:45:48,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:45:48 BoogieIcfgContainer [2019-12-26 22:45:48,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:45:48,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:45:48,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:45:48,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:45:48,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:45:47" (1/3) ... [2019-12-26 22:45:49,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:45:48, skipping insertion in model container [2019-12-26 22:45:49,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:48" (2/3) ... [2019-12-26 22:45:49,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:45:49, skipping insertion in model container [2019-12-26 22:45:49,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:45:48" (3/3) ... [2019-12-26 22:45:49,002 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2019-12-26 22:45:49,013 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:45:49,014 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:45:49,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:45:49,024 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:45:49,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,121 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,121 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,122 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,122 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,124 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,124 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,124 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,129 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,130 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,131 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,143 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,149 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,149 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,152 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,152 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,152 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,153 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,154 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,156 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,157 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:49,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:45:49,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:45:49,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:45:49,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:45:49,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:45:49,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:45:49,190 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:45:49,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:45:49,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:45:49,207 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-26 22:45:49,209 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:45:49,308 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:45:49,309 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:45:49,322 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:45:49,342 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:45:49,398 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:45:49,398 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:45:49,405 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:45:49,420 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:45:49,421 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:45:54,408 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:45:54,551 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:45:54,607 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-26 22:45:54,607 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-26 22:45:54,610 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-26 22:45:57,612 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-26 22:45:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-26 22:45:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:45:57,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:57,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:57,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-26 22:45:57,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:57,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824089107] [2019-12-26 22:45:57,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:57,933 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-26 22:45:57,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824089107] [2019-12-26 22:45:57,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:57,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:45:57,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137843978] [2019-12-26 22:45:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:57,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:57,960 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-26 22:45:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:58,618 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-26 22:45:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:45:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:59,058 INFO L225 Difference]: With dead ends: 34366 [2019-12-26 22:45:59,059 INFO L226 Difference]: Without dead ends: 33638 [2019-12-26 22:45:59,061 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-26 22:45:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-26 22:46:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-26 22:46:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-26 22:46:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-26 22:46:01,303 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-26 22:46:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:01,305 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-26 22:46:01,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-26 22:46:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:46:02,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:02,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:02,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-26 22:46:02,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:02,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405604237] [2019-12-26 22:46:02,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:02,771 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-26 22:46:02,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405604237] [2019-12-26 22:46:02,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:02,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:02,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276028950] [2019-12-26 22:46:02,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:46:02,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:46:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:46:02,776 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-26 22:46:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:03,581 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-26 22:46:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:46:03,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:46:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:03,851 INFO L225 Difference]: With dead ends: 52350 [2019-12-26 22:46:03,851 INFO L226 Difference]: Without dead ends: 52322 [2019-12-26 22:46:03,852 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-26 22:46:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-26 22:46:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-26 22:46:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-26 22:46:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-26 22:46:06,190 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-26 22:46:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:06,190 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-26 22:46:06,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:46:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-26 22:46:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:46:06,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:06,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:06,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-26 22:46:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:06,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614872316] [2019-12-26 22:46:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:06,281 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-26 22:46:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614872316] [2019-12-26 22:46:06,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:06,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939254389] [2019-12-26 22:46:06,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:06,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:06,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:06,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:06,286 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-26 22:46:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:06,888 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-26 22:46:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:06,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:46:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:07,009 INFO L225 Difference]: With dead ends: 37462 [2019-12-26 22:46:07,010 INFO L226 Difference]: Without dead ends: 37462 [2019-12-26 22:46:07,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-26 22:46:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-26 22:46:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-26 22:46:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-26 22:46:08,386 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-26 22:46:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:08,386 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-26 22:46:08,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-26 22:46:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:46:08,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:08,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:08,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-26 22:46:08,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763881345] [2019-12-26 22:46:08,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:08,434 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-26 22:46:08,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763881345] [2019-12-26 22:46:08,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:08,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:46:08,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666287773] [2019-12-26 22:46:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:46:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:46:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:46:08,436 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-26 22:46:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:08,508 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-26 22:46:08,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:46:08,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:46:08,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:08,532 INFO L225 Difference]: With dead ends: 15610 [2019-12-26 22:46:08,533 INFO L226 Difference]: Without dead ends: 15610 [2019-12-26 22:46:08,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:46:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-26 22:46:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-26 22:46:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-26 22:46:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-26 22:46:08,800 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-26 22:46:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:08,800 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-26 22:46:08,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:46:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-26 22:46:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:46:08,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:08,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:08,803 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-26 22:46:08,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:08,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389517637] [2019-12-26 22:46:08,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:08,849 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-26 22:46:08,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389517637] [2019-12-26 22:46:08,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:08,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:46:08,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818503874] [2019-12-26 22:46:08,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:46:08,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:08,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:46:08,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:08,851 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-26 22:46:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:08,901 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-26 22:46:08,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:46:08,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:46:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:08,906 INFO L225 Difference]: With dead ends: 2718 [2019-12-26 22:46:08,906 INFO L226 Difference]: Without dead ends: 2718 [2019-12-26 22:46:08,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-26 22:46:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-26 22:46:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-26 22:46:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-26 22:46:09,041 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-26 22:46:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-26 22:46:09,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:46:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-26 22:46:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:46:09,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:09,046 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] [2019-12-26 22:46:09,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-26 22:46:09,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:09,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057358348] [2019-12-26 22:46:09,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:09,131 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-26 22:46:09,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057358348] [2019-12-26 22:46:09,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:09,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:09,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078182166] [2019-12-26 22:46:09,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:09,133 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-26 22:46:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:09,176 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-26 22:46:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:09,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:46:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:09,179 INFO L225 Difference]: With dead ends: 1354 [2019-12-26 22:46:09,179 INFO L226 Difference]: Without dead ends: 1354 [2019-12-26 22:46:09,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-26 22:46:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-26 22:46:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-26 22:46:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-26 22:46:09,198 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-26 22:46:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:09,198 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-26 22:46:09,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-26 22:46:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:09,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:09,202 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, 1] [2019-12-26 22:46:09,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-26 22:46:09,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:09,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274516795] [2019-12-26 22:46:09,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:09,282 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-26 22:46:09,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274516795] [2019-12-26 22:46:09,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:09,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:46:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800485505] [2019-12-26 22:46:09,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:09,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:09,285 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-26 22:46:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:09,322 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-26 22:46:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:09,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:46:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:09,325 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 22:46:09,325 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 22:46:09,325 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-26 22:46:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 22:46:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-26 22:46:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:46:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-26 22:46:09,345 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-26 22:46:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:09,346 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-26 22:46:09,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-26 22:46:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:09,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:09,350 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, 1] [2019-12-26 22:46:09,351 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-26 22:46:09,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:09,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912236425] [2019-12-26 22:46:09,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:09,452 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-26 22:46:09,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912236425] [2019-12-26 22:46:09,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:09,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:09,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813836783] [2019-12-26 22:46:09,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:46:09,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:46:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:09,454 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-26 22:46:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:09,677 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-26 22:46:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:09,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:46:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:09,681 INFO L225 Difference]: With dead ends: 1758 [2019-12-26 22:46:09,681 INFO L226 Difference]: Without dead ends: 1758 [2019-12-26 22:46:09,682 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-26 22:46:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-26 22:46:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-26 22:46:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-26 22:46:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-26 22:46:09,709 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-26 22:46:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:09,709 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-26 22:46:09,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:46:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-26 22:46:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:09,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:09,714 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, 1] [2019-12-26 22:46:09,714 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-26 22:46:09,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:09,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676606432] [2019-12-26 22:46:09,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:09,848 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-26 22:46:09,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676606432] [2019-12-26 22:46:09,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:09,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:46:09,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069878553] [2019-12-26 22:46:09,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:09,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:09,851 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-26 22:46:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:10,193 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-26 22:46:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:46:10,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:46:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:10,198 INFO L225 Difference]: With dead ends: 2360 [2019-12-26 22:46:10,198 INFO L226 Difference]: Without dead ends: 2360 [2019-12-26 22:46:10,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:46:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-26 22:46:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-26 22:46:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-26 22:46:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-26 22:46:10,230 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-26 22:46:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:10,230 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-26 22:46:10,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-26 22:46:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:10,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:10,235 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, 1] [2019-12-26 22:46:10,235 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:10,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-26 22:46:10,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:10,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168201704] [2019-12-26 22:46:10,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:10,352 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-26 22:46:10,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168201704] [2019-12-26 22:46:10,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:10,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:46:10,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533922721] [2019-12-26 22:46:10,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:10,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:10,354 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-26 22:46:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:10,697 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-26 22:46:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:46:10,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:46:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:10,701 INFO L225 Difference]: With dead ends: 2371 [2019-12-26 22:46:10,701 INFO L226 Difference]: Without dead ends: 2371 [2019-12-26 22:46:10,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:46:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-26 22:46:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-26 22:46:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-26 22:46:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-26 22:46:10,726 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-26 22:46:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:10,726 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-26 22:46:10,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-26 22:46:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:10,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:10,730 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, 1] [2019-12-26 22:46:10,730 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-26 22:46:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:10,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053373510] [2019-12-26 22:46:10,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:46:10,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053373510] [2019-12-26 22:46:10,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:10,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:10,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106062065] [2019-12-26 22:46:10,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:10,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:10,806 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 3 states. [2019-12-26 22:46:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:10,850 INFO L93 Difference]: Finished difference Result 1685 states and 4854 transitions. [2019-12-26 22:46:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:10,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:46:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:10,854 INFO L225 Difference]: With dead ends: 1685 [2019-12-26 22:46:10,854 INFO L226 Difference]: Without dead ends: 1685 [2019-12-26 22:46:10,854 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-26 22:46:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2019-12-26 22:46:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1076. [2019-12-26 22:46:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-26 22:46:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 3124 transitions. [2019-12-26 22:46:10,876 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 3124 transitions. Word has length 58 [2019-12-26 22:46:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:10,877 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 3124 transitions. [2019-12-26 22:46:10,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 3124 transitions. [2019-12-26 22:46:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:46:10,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:10,880 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, 1, 1] [2019-12-26 22:46:10,880 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:10,880 INFO L82 PathProgramCache]: Analyzing trace with hash -248733535, now seen corresponding path program 1 times [2019-12-26 22:46:10,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:10,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662842486] [2019-12-26 22:46:10,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:11,059 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-26 22:46:11,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662842486] [2019-12-26 22:46:11,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:11,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:46:11,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854031235] [2019-12-26 22:46:11,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:46:11,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:46:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:46:11,061 INFO L87 Difference]: Start difference. First operand 1076 states and 3124 transitions. Second operand 7 states. [2019-12-26 22:46:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:11,219 INFO L93 Difference]: Finished difference Result 2236 states and 6157 transitions. [2019-12-26 22:46:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:46:11,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-26 22:46:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:11,222 INFO L225 Difference]: With dead ends: 2236 [2019-12-26 22:46:11,223 INFO L226 Difference]: Without dead ends: 1589 [2019-12-26 22:46:11,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:46:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-12-26 22:46:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 946. [2019-12-26 22:46:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-26 22:46:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2684 transitions. [2019-12-26 22:46:11,244 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2684 transitions. Word has length 59 [2019-12-26 22:46:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:11,245 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2684 transitions. [2019-12-26 22:46:11,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:46:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2684 transitions. [2019-12-26 22:46:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:46:11,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:11,248 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, 1, 1] [2019-12-26 22:46:11,248 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 2 times [2019-12-26 22:46:11,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:11,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673009790] [2019-12-26 22:46:11,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:11,345 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-26 22:46:11,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673009790] [2019-12-26 22:46:11,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:11,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:11,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567790694] [2019-12-26 22:46:11,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:11,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:11,349 INFO L87 Difference]: Start difference. First operand 946 states and 2684 transitions. Second operand 3 states. [2019-12-26 22:46:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:11,366 INFO L93 Difference]: Finished difference Result 890 states and 2456 transitions. [2019-12-26 22:46:11,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:11,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:46:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:11,368 INFO L225 Difference]: With dead ends: 890 [2019-12-26 22:46:11,368 INFO L226 Difference]: Without dead ends: 890 [2019-12-26 22:46:11,372 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-26 22:46:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-26 22:46:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 826. [2019-12-26 22:46:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-26 22:46:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-26 22:46:11,406 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 59 [2019-12-26 22:46:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:11,406 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-26 22:46:11,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-26 22:46:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:11,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:11,409 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, 1, 1, 1] [2019-12-26 22:46:11,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 1 times [2019-12-26 22:46:11,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:11,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974540568] [2019-12-26 22:46:11,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:11,544 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-26 22:46:11,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974540568] [2019-12-26 22:46:11,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:11,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:46:11,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583491422] [2019-12-26 22:46:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:46:11,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:46:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:11,546 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 5 states. [2019-12-26 22:46:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:11,591 INFO L93 Difference]: Finished difference Result 1031 states and 2639 transitions. [2019-12-26 22:46:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:46:11,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 22:46:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:11,592 INFO L225 Difference]: With dead ends: 1031 [2019-12-26 22:46:11,592 INFO L226 Difference]: Without dead ends: 600 [2019-12-26 22:46:11,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:46:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-26 22:46:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-12-26 22:46:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-26 22:46:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-26 22:46:11,600 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-26 22:46:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:11,601 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-26 22:46:11,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:46:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-26 22:46:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:11,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:11,602 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, 1, 1, 1] [2019-12-26 22:46:11,603 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-26 22:46:11,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:11,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897733370] [2019-12-26 22:46:11,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:11,731 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-26 22:46:11,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897733370] [2019-12-26 22:46:11,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:11,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:11,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366772997] [2019-12-26 22:46:11,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:11,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:11,733 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 6 states. [2019-12-26 22:46:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:11,818 INFO L93 Difference]: Finished difference Result 985 states and 2333 transitions. [2019-12-26 22:46:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:11,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 22:46:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:11,819 INFO L225 Difference]: With dead ends: 985 [2019-12-26 22:46:11,819 INFO L226 Difference]: Without dead ends: 264 [2019-12-26 22:46:11,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:46:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-26 22:46:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-12-26 22:46:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-26 22:46:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-26 22:46:11,823 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-26 22:46:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:11,823 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-26 22:46:11,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-26 22:46:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:11,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:11,825 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, 1, 1, 1] [2019-12-26 22:46:11,825 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-26 22:46:11,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:11,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562786906] [2019-12-26 22:46:11,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:12,135 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-26 22:46:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562786906] [2019-12-26 22:46:12,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:12,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:12,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221557644] [2019-12-26 22:46:12,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:46:12,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:46:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:46:12,137 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-26 22:46:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:12,706 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2019-12-26 22:46:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:46:12,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:46:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:12,708 INFO L225 Difference]: With dead ends: 386 [2019-12-26 22:46:12,708 INFO L226 Difference]: Without dead ends: 358 [2019-12-26 22:46:12,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:46:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-26 22:46:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-12-26 22:46:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-26 22:46:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-26 22:46:12,713 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-26 22:46:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:12,713 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-26 22:46:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:46:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-26 22:46:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:12,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:12,714 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, 1, 1, 1] [2019-12-26 22:46:12,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 4 times [2019-12-26 22:46:12,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:12,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847136310] [2019-12-26 22:46:12,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:12,986 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-26 22:46:12,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847136310] [2019-12-26 22:46:12,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:12,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:12,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921837789] [2019-12-26 22:46:12,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:46:12,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:12,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:46:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:46:12,989 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-26 22:46:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:13,532 INFO L93 Difference]: Finished difference Result 458 states and 779 transitions. [2019-12-26 22:46:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:46:13,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:46:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:13,534 INFO L225 Difference]: With dead ends: 458 [2019-12-26 22:46:13,534 INFO L226 Difference]: Without dead ends: 430 [2019-12-26 22:46:13,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:46:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-26 22:46:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 332. [2019-12-26 22:46:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-26 22:46:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-26 22:46:13,539 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-26 22:46:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:13,539 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-26 22:46:13,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:46:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-26 22:46:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:13,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:13,540 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, 1, 1, 1] [2019-12-26 22:46:13,541 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:13,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 5 times [2019-12-26 22:46:13,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:13,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969057312] [2019-12-26 22:46:13,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:13,797 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-26 22:46:13,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969057312] [2019-12-26 22:46:13,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:13,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:13,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028671059] [2019-12-26 22:46:13,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:46:13,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:46:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:46:13,799 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 13 states. [2019-12-26 22:46:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:14,304 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-26 22:46:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:46:14,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:46:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:14,305 INFO L225 Difference]: With dead ends: 446 [2019-12-26 22:46:14,305 INFO L226 Difference]: Without dead ends: 418 [2019-12-26 22:46:14,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:46:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-26 22:46:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-26 22:46:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-26 22:46:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-26 22:46:14,311 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-26 22:46:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:14,311 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-26 22:46:14,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:46:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-26 22:46:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:14,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:14,312 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, 1, 1, 1] [2019-12-26 22:46:14,312 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 6 times [2019-12-26 22:46:14,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:14,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279950731] [2019-12-26 22:46:14,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:46:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:46:14,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:46:14,423 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:46:14,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1269~0.base_21|) |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21| 1) |v_#valid_73|) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1269~0.base_21|) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= 0 v_~z$r_buff0_thd3~0_189) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1269~0.base_21|)) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= |v_ULTIMATE.start_main_~#t1269~0.offset_17| 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1269~0.base_21| 4) |v_#length_29|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_~#t1269~0.base=|v_ULTIMATE.start_main_~#t1269~0.base_21|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_18|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_~#t1269~0.offset=|v_ULTIMATE.start_main_~#t1269~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1270~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1270~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1269~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1272~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1272~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1269~0.offset, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1271~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:46:14,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13| 1) |v_#valid_44|) (not (= |v_ULTIMATE.start_main_~#t1270~0.base_13| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1270~0.base_13|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1270~0.base_13|) (= |v_ULTIMATE.start_main_~#t1270~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1270~0.base_13|) |v_ULTIMATE.start_main_~#t1270~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1270~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1270~0.offset=|v_ULTIMATE.start_main_~#t1270~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t1270~0.base=|v_ULTIMATE.start_main_~#t1270~0.base_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1270~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1270~0.base, #length] because there is no mapped edge [2019-12-26 22:46:14,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1271~0.offset_10| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1271~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1271~0.base_11|) |v_ULTIMATE.start_main_~#t1271~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1271~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1271~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1271~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1271~0.base=|v_ULTIMATE.start_main_~#t1271~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1271~0.offset=|v_ULTIMATE.start_main_~#t1271~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1271~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1271~0.offset] because there is no mapped edge [2019-12-26 22:46:14,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t1272~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1272~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1272~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1272~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1272~0.base_13|) |v_ULTIMATE.start_main_~#t1272~0.offset_11| 3))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1272~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1272~0.base=|v_ULTIMATE.start_main_~#t1272~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1272~0.offset=|v_ULTIMATE.start_main_~#t1272~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1272~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1272~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-26 22:46:14,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:46:14,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:46:14,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:46:14,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1214305044 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1214305044 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1214305044| 0)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out1214305044| ~z$w_buff0_used~0_In1214305044) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1214305044, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1214305044} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1214305044, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1214305044, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1214305044|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:46:14,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-1922051253 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1922051253 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1922051253 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1922051253 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out-1922051253| ~z$w_buff1_used~0_In-1922051253)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1922051253| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1922051253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1922051253} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1922051253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1922051253, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1922051253|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:46:14,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-966890697 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-966890697 256)))) (or (and (= ~z$w_buff1~0_In-966890697 |P2Thread1of1ForFork2_#t~ite3_Out-966890697|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-966890697 |P2Thread1of1ForFork2_#t~ite3_Out-966890697|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-966890697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-966890697, ~z$w_buff1~0=~z$w_buff1~0_In-966890697, ~z~0=~z~0_In-966890697} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-966890697|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-966890697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-966890697, ~z$w_buff1~0=~z$w_buff1~0_In-966890697, ~z~0=~z~0_In-966890697} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:46:14,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:46:14,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1669047674 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1669047674 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1669047674| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1669047674| ~z$w_buff0_used~0_In-1669047674)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1669047674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1669047674} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1669047674|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1669047674, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1669047674} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:46:14,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1949634239 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1949634239 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1949634239 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1949634239 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1949634239| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1949634239| ~z$w_buff1_used~0_In1949634239) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1949634239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1949634239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1949634239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1949634239} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1949634239|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1949634239, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1949634239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1949634239, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1949634239} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:46:14,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2132419478 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2132419478 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out2132419478| ~z$r_buff0_thd3~0_In2132419478) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2132419478| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2132419478, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2132419478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2132419478, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2132419478, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2132419478|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:46:14,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-728144729 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-728144729 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-728144729 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-728144729 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-728144729|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-728144729 |P2Thread1of1ForFork2_#t~ite8_Out-728144729|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-728144729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-728144729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728144729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-728144729} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-728144729, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-728144729, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728144729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-728144729, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-728144729|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:46:14,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:46:14,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1881698642 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1881698642 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1881698642) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1881698642 ~z$r_buff0_thd4~0_In1881698642) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1881698642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1881698642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1881698642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1881698642, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1881698642|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:46:14,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-573863866 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-573863866 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-573863866 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-573863866 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-573863866| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-573863866| ~z$r_buff1_thd4~0_In-573863866) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-573863866, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573863866, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-573863866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-573863866} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-573863866, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573863866, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-573863866|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-573863866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-573863866} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:46:14,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:46:14,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:46:14,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In76809626 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out76809626| |ULTIMATE.start_main_#t~ite20_Out76809626|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In76809626 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite19_Out76809626| ~z~0_In76809626)) (and (not .cse1) .cse2 (= ~z$w_buff1~0_In76809626 |ULTIMATE.start_main_#t~ite19_Out76809626|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$w_buff1~0=~z$w_buff1~0_In76809626, ~z~0=~z~0_In76809626} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out76809626|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$w_buff1~0=~z$w_buff1~0_In76809626, ~z~0=~z~0_In76809626, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out76809626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:46:14,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1693299632 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1693299632 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1693299632| ~z$w_buff0_used~0_In1693299632) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1693299632| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1693299632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1693299632} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1693299632, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1693299632, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1693299632|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:46:14,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-627772457 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-627772457 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-627772457 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-627772457 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-627772457| ~z$w_buff1_used~0_In-627772457)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-627772457| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627772457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-627772457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-627772457} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627772457, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-627772457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-627772457, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-627772457|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:46:14,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-559137553 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-559137553 256)))) (or (and (= ~z$r_buff0_thd0~0_In-559137553 |ULTIMATE.start_main_#t~ite23_Out-559137553|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-559137553| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-559137553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-559137553} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-559137553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-559137553, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-559137553|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:46:14,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1591062673 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1591062673 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1591062673 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1591062673 256)))) (or (and (= ~z$r_buff1_thd0~0_In1591062673 |ULTIMATE.start_main_#t~ite24_Out1591062673|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out1591062673|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1591062673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1591062673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591062673} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1591062673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1591062673, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1591062673|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591062673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:46:14,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1470356930 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-1470356930| ~z$w_buff0~0_In-1470356930) (= |ULTIMATE.start_main_#t~ite30_In-1470356930| |ULTIMATE.start_main_#t~ite30_Out-1470356930|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out-1470356930| ~z$w_buff0~0_In-1470356930) (= |ULTIMATE.start_main_#t~ite31_Out-1470356930| |ULTIMATE.start_main_#t~ite30_Out-1470356930|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1470356930 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1470356930 256)) (and (= (mod ~z$r_buff1_thd0~0_In-1470356930 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1470356930 256)) .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1470356930, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1470356930|, ~z$w_buff0~0=~z$w_buff0~0_In-1470356930, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ~weak$$choice2~0=~weak$$choice2~0_In-1470356930} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1470356930, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1470356930|, ~z$w_buff0~0=~z$w_buff0~0_In-1470356930, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1470356930|, ~weak$$choice2~0=~weak$$choice2~0_In-1470356930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-26 22:46:14,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In102220159 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In102220159 |ULTIMATE.start_main_#t~ite34_Out102220159|) (= |ULTIMATE.start_main_#t~ite33_In102220159| |ULTIMATE.start_main_#t~ite33_Out102220159|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In102220159 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In102220159 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In102220159 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In102220159 256) 0))) (= |ULTIMATE.start_main_#t~ite34_Out102220159| |ULTIMATE.start_main_#t~ite33_Out102220159|) (= ~z$w_buff1~0_In102220159 |ULTIMATE.start_main_#t~ite33_Out102220159|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102220159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102220159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102220159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102220159, ~z$w_buff1~0=~z$w_buff1~0_In102220159, ~weak$$choice2~0=~weak$$choice2~0_In102220159, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In102220159|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102220159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102220159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In102220159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102220159, ~z$w_buff1~0=~z$w_buff1~0_In102220159, ~weak$$choice2~0=~weak$$choice2~0_In102220159, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out102220159|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out102220159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 22:46:14,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:46:14,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1241443587 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1241443587| |ULTIMATE.start_main_#t~ite45_Out-1241443587|) (= |ULTIMATE.start_main_#t~ite45_Out-1241443587| ~z$r_buff1_thd0~0_In-1241443587) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1241443587 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1241443587 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1241443587 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1241443587 256)) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-1241443587| ~z$r_buff1_thd0~0_In-1241443587) (= |ULTIMATE.start_main_#t~ite45_In-1241443587| |ULTIMATE.start_main_#t~ite45_Out-1241443587|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1241443587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1241443587, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1241443587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1241443587, ~weak$$choice2~0=~weak$$choice2~0_In-1241443587, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1241443587|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1241443587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1241443587, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1241443587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1241443587, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1241443587|, ~weak$$choice2~0=~weak$$choice2~0_In-1241443587, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1241443587|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:46:14,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:46:14,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:46:14,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:46:14 BasicIcfg [2019-12-26 22:46:14,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:46:14,583 INFO L168 Benchmark]: Toolchain (without parser) took 27339.44 ms. Allocated memory was 146.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 102.3 MB in the beginning and 401.3 MB in the end (delta: -299.0 MB). Peak memory consumption was 809.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,583 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.9 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,585 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,586 INFO L168 Benchmark]: RCFGBuilder took 877.99 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.5 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,587 INFO L168 Benchmark]: TraceAbstraction took 25586.62 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.9 MB in the beginning and 401.3 MB in the end (delta: -300.4 MB). Peak memory consumption was 751.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:14,590 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.52 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.9 MB in the beginning and 156.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.88 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 877.99 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.5 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25586.62 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 100.9 MB in the beginning and 401.3 MB in the end (delta: -300.4 MB). Peak memory consumption was 751.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1870 SDtfs, 1937 SDslu, 4823 SDs, 0 SdLazy, 2163 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 8169 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 869 NumberOfCodeBlocks, 869 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 186930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...