/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:33:02,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:33:02,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:33:02,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:33:02,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:33:02,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:33:02,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:33:02,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:33:02,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:33:02,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:33:02,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:33:02,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:33:02,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:33:02,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:33:02,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:33:02,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:33:02,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:33:02,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:33:02,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:33:02,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:33:02,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:33:02,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:33:02,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:33:02,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:33:02,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:33:02,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:33:02,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:33:02,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:33:02,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:33:02,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:33:02,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:33:02,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:33:02,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:33:02,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:33:02,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:33:02,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:33:02,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:33:02,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:33:02,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:33:02,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:33:02,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:33:02,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:33:02,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:33:02,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:33:02,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:33:02,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:33:02,904 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:33:02,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:33:02,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:33:02,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:33:02,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:33:02,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:33:02,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:33:02,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:33:02,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:33:02,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:33:02,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:33:02,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:33:02,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:33:02,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:33:02,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:33:02,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:33:02,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:33:02,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:33:02,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:33:02,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:33:03,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:33:03,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:33:03,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:33:03,229 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:33:03,229 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:33:03,230 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-27 02:33:03,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467d40646/4b5bb70a928246e99f2d070a2c732bb5/FLAG0f0b43e03 [2019-12-27 02:33:03,822 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:33:03,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-27 02:33:03,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467d40646/4b5bb70a928246e99f2d070a2c732bb5/FLAG0f0b43e03 [2019-12-27 02:33:04,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467d40646/4b5bb70a928246e99f2d070a2c732bb5 [2019-12-27 02:33:04,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:33:04,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:33:04,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:33:04,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:33:04,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:33:04,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:04,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04, skipping insertion in model container [2019-12-27 02:33:04,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:04,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:33:04,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:33:04,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:33:04,797 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:33:04,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:33:04,984 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:33:04,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04 WrapperNode [2019-12-27 02:33:04,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:33:04,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:33:04,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:33:04,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:33:04,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:33:05,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:33:05,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:33:05,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:33:05,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (1/1) ... [2019-12-27 02:33:05,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:33:05,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:33:05,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:33:05,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:33:05,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (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-27 02:33:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:33:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:33:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:33:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:33:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:33:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:33:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:33:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:33:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:33:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:33:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:33:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:33:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:33:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:33:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:33:05,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-27 02:33:05,953 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:33:05,953 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:33:05,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:33:05 BoogieIcfgContainer [2019-12-27 02:33:05,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:33:05,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:33:05,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:33:05,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:33:05,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:33:04" (1/3) ... [2019-12-27 02:33:05,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0ef27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:33:05, skipping insertion in model container [2019-12-27 02:33:05,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:04" (2/3) ... [2019-12-27 02:33:05,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0ef27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:33:05, skipping insertion in model container [2019-12-27 02:33:05,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:33:05" (3/3) ... [2019-12-27 02:33:05,963 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-27 02:33:05,973 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:33:05,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:33:05,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:33:05,981 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:33:06,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,037 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,037 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,045 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,045 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,046 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,047 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,048 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,049 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,050 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,061 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,064 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,064 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,066 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,066 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,066 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,066 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,067 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:06,080 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:33:06,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:33:06,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:33:06,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:33:06,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:33:06,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:33:06,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:33:06,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:33:06,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:33:06,115 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 02:33:06,117 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:33:06,222 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:33:06,223 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:33:06,243 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:33:06,259 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:33:06,337 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:33:06,338 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:33:06,344 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:33:06,360 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:33:06,361 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:33:11,645 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:33:11,833 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:33:11,853 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-27 02:33:11,853 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-27 02:33:11,857 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 02:33:13,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-27 02:33:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-27 02:33:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:33:14,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:14,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:14,006 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-27 02:33:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-27 02:33:14,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:14,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231144110] [2019-12-27 02:33:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:14,938 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-27 02:33:14,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231144110] [2019-12-27 02:33:14,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:14,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:33:14,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877260081] [2019-12-27 02:33:14,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:14,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:14,967 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-27 02:33:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:15,595 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-27 02:33:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:15,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:33:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:15,967 INFO L225 Difference]: With dead ends: 33638 [2019-12-27 02:33:15,967 INFO L226 Difference]: Without dead ends: 32966 [2019-12-27 02:33:15,969 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-27 02:33:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-27 02:33:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-27 02:33:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-27 02:33:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-27 02:33:17,858 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-27 02:33:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:17,859 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-27 02:33:17,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-27 02:33:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:33:17,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:17,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:17,867 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-27 02:33:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-27 02:33:17,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:17,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710670337] [2019-12-27 02:33:17,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:18,004 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-27 02:33:18,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710670337] [2019-12-27 02:33:18,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:18,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:18,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622164455] [2019-12-27 02:33:18,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:18,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:18,010 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-27 02:33:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:20,252 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-27 02:33:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:20,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:33:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:20,476 INFO L225 Difference]: With dead ends: 44494 [2019-12-27 02:33:20,477 INFO L226 Difference]: Without dead ends: 44494 [2019-12-27 02:33:20,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-27 02:33:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-27 02:33:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-27 02:33:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-27 02:33:24,543 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-27 02:33:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:24,543 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-27 02:33:24,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-27 02:33:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:33:24,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:24,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:24,548 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-27 02:33:24,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:24,548 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-27 02:33:24,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:24,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397838560] [2019-12-27 02:33:24,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:24,660 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-27 02:33:24,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397838560] [2019-12-27 02:33:24,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:24,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:24,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374814138] [2019-12-27 02:33:24,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:24,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:24,666 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-27 02:33:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:25,220 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-27 02:33:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:25,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:33:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:25,628 INFO L225 Difference]: With dead ends: 62082 [2019-12-27 02:33:25,628 INFO L226 Difference]: Without dead ends: 62054 [2019-12-27 02:33:25,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-27 02:33:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-27 02:33:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-27 02:33:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-27 02:33:28,084 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-27 02:33:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:28,085 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-27 02:33:28,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-27 02:33:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:33:28,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:28,100 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] [2019-12-27 02:33:28,101 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-27 02:33:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-27 02:33:28,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:28,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026816502] [2019-12-27 02:33:28,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:28,204 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-27 02:33:28,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026816502] [2019-12-27 02:33:28,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:28,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:28,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633844010] [2019-12-27 02:33:28,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:28,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:28,207 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-27 02:33:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:29,575 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-27 02:33:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:33:29,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 02:33:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:29,813 INFO L225 Difference]: With dead ends: 68854 [2019-12-27 02:33:29,813 INFO L226 Difference]: Without dead ends: 68826 [2019-12-27 02:33:29,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-27 02:33:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-27 02:33:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-27 02:33:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-27 02:33:33,673 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-27 02:33:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:33,673 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-27 02:33:33,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-27 02:33:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:33:33,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:33,732 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-27 02:33:33,732 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-27 02:33:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-27 02:33:33,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:33,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071780049] [2019-12-27 02:33:33,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:33,784 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-27 02:33:33,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071780049] [2019-12-27 02:33:33,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:33,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:33,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798198512] [2019-12-27 02:33:33,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:33,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:33,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:33,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:33,788 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-27 02:33:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:34,516 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-27 02:33:34,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:34,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 02:33:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:34,673 INFO L225 Difference]: With dead ends: 64130 [2019-12-27 02:33:34,673 INFO L226 Difference]: Without dead ends: 64130 [2019-12-27 02:33:34,674 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-27 02:33:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-27 02:33:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-27 02:33:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-27 02:33:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-27 02:33:38,476 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-27 02:33:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:38,476 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-27 02:33:38,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-27 02:33:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:33:38,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:38,513 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-27 02:33:38,513 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-27 02:33:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-27 02:33:38,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:38,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586686309] [2019-12-27 02:33:38,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:38,656 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-27 02:33:38,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586686309] [2019-12-27 02:33:38,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:38,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:33:38,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964224073] [2019-12-27 02:33:38,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:33:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:33:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:33:38,659 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-27 02:33:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:39,833 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-27 02:33:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:33:39,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:33:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:40,046 INFO L225 Difference]: With dead ends: 81602 [2019-12-27 02:33:40,046 INFO L226 Difference]: Without dead ends: 81538 [2019-12-27 02:33:40,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-27 02:33:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-27 02:33:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:33:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-27 02:33:44,317 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-27 02:33:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:44,318 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-27 02:33:44,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:33:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-27 02:33:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:33:44,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:44,390 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] [2019-12-27 02:33:44,390 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-27 02:33:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-27 02:33:44,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:44,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425245514] [2019-12-27 02:33:44,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:44,468 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-27 02:33:44,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425245514] [2019-12-27 02:33:44,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:44,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:44,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723467287] [2019-12-27 02:33:44,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:44,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:44,470 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-27 02:33:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:45,379 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-27 02:33:45,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:45,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-27 02:33:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:45,548 INFO L225 Difference]: With dead ends: 65578 [2019-12-27 02:33:45,549 INFO L226 Difference]: Without dead ends: 65578 [2019-12-27 02:33:45,549 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-27 02:33:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-27 02:33:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-27 02:33:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:33:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-27 02:33:47,524 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-27 02:33:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:47,525 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-27 02:33:47,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-27 02:33:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:33:47,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:47,582 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] [2019-12-27 02:33:47,582 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-27 02:33:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-27 02:33:47,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:47,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031217758] [2019-12-27 02:33:47,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:47,764 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-27 02:33:47,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031217758] [2019-12-27 02:33:47,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:47,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:47,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805188803] [2019-12-27 02:33:47,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:33:47,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:33:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:33:47,766 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 7 states. [2019-12-27 02:33:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:52,127 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-27 02:33:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:33:52,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 02:33:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:52,363 INFO L225 Difference]: With dead ends: 89414 [2019-12-27 02:33:52,363 INFO L226 Difference]: Without dead ends: 89310 [2019-12-27 02:33:52,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:33:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-27 02:33:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-27 02:33:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-27 02:33:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-27 02:33:54,131 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-27 02:33:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:54,132 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-27 02:33:54,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:33:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-27 02:33:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:33:54,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:54,198 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] [2019-12-27 02:33:54,198 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-27 02:33:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-27 02:33:54,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:54,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083201400] [2019-12-27 02:33:54,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:54,266 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-27 02:33:54,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083201400] [2019-12-27 02:33:54,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:54,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:54,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093208186] [2019-12-27 02:33:54,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:54,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:54,269 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-27 02:33:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:54,488 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-27 02:33:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:33:54,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 02:33:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:54,585 INFO L225 Difference]: With dead ends: 47360 [2019-12-27 02:33:54,586 INFO L226 Difference]: Without dead ends: 46252 [2019-12-27 02:33:54,586 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-27 02:33:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-27 02:33:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-27 02:33:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-27 02:33:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-27 02:33:56,108 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-27 02:33:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:56,108 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-27 02:33:56,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:33:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-27 02:33:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 02:33:56,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:56,146 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] [2019-12-27 02:33:56,146 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-27 02:33:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-27 02:33:56,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:56,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448037422] [2019-12-27 02:33:56,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:56,242 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-27 02:33:56,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448037422] [2019-12-27 02:33:56,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:56,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:33:56,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658622518] [2019-12-27 02:33:56,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:33:56,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:33:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:33:56,244 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 5 states. [2019-12-27 02:33:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:56,663 INFO L93 Difference]: Finished difference Result 47758 states and 182041 transitions. [2019-12-27 02:33:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:33:56,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-27 02:33:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:56,801 INFO L225 Difference]: With dead ends: 47758 [2019-12-27 02:33:56,801 INFO L226 Difference]: Without dead ends: 45724 [2019-12-27 02:33:56,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-27 02:33:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45724 states. [2019-12-27 02:33:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45724 to 45724. [2019-12-27 02:33:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45724 states. [2019-12-27 02:33:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45724 states to 45724 states and 174255 transitions. [2019-12-27 02:33:58,321 INFO L78 Accepts]: Start accepts. Automaton has 45724 states and 174255 transitions. Word has length 36 [2019-12-27 02:33:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:58,322 INFO L462 AbstractCegarLoop]: Abstraction has 45724 states and 174255 transitions. [2019-12-27 02:33:58,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:33:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45724 states and 174255 transitions. [2019-12-27 02:33:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:33:58,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:58,365 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] [2019-12-27 02:33:58,365 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-27 02:33:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:58,365 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-27 02:33:58,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:58,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468135144] [2019-12-27 02:33:58,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:33:58,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468135144] [2019-12-27 02:33:58,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:58,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:33:58,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481721717] [2019-12-27 02:33:58,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:33:58,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:33:58,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:33:58,465 INFO L87 Difference]: Start difference. First operand 45724 states and 174255 transitions. Second operand 6 states. [2019-12-27 02:33:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:58,812 INFO L93 Difference]: Finished difference Result 68562 states and 256394 transitions. [2019-12-27 02:33:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:33:58,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-27 02:33:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:58,902 INFO L225 Difference]: With dead ends: 68562 [2019-12-27 02:33:58,902 INFO L226 Difference]: Without dead ends: 39844 [2019-12-27 02:33:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:33:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39844 states. [2019-12-27 02:33:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39844 to 39844. [2019-12-27 02:33:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39844 states. [2019-12-27 02:34:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39844 states to 39844 states and 150224 transitions. [2019-12-27 02:34:00,275 INFO L78 Accepts]: Start accepts. Automaton has 39844 states and 150224 transitions. Word has length 38 [2019-12-27 02:34:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:00,276 INFO L462 AbstractCegarLoop]: Abstraction has 39844 states and 150224 transitions. [2019-12-27 02:34:00,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39844 states and 150224 transitions. [2019-12-27 02:34:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:34:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:00,309 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] [2019-12-27 02:34:00,309 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-27 02:34:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash -308573782, now seen corresponding path program 2 times [2019-12-27 02:34:00,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:00,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557760655] [2019-12-27 02:34:00,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:00,479 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-27 02:34:00,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557760655] [2019-12-27 02:34:00,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:00,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:34:00,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565654719] [2019-12-27 02:34:00,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:34:00,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:00,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:34:00,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:00,481 INFO L87 Difference]: Start difference. First operand 39844 states and 150224 transitions. Second operand 10 states. [2019-12-27 02:34:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:01,445 INFO L93 Difference]: Finished difference Result 82226 states and 311987 transitions. [2019-12-27 02:34:01,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:34:01,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 02:34:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:01,597 INFO L225 Difference]: With dead ends: 82226 [2019-12-27 02:34:01,598 INFO L226 Difference]: Without dead ends: 68725 [2019-12-27 02:34:01,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:34:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68725 states. [2019-12-27 02:34:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68725 to 61068. [2019-12-27 02:34:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61068 states. [2019-12-27 02:34:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61068 states to 61068 states and 232467 transitions. [2019-12-27 02:34:03,315 INFO L78 Accepts]: Start accepts. Automaton has 61068 states and 232467 transitions. Word has length 38 [2019-12-27 02:34:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:03,315 INFO L462 AbstractCegarLoop]: Abstraction has 61068 states and 232467 transitions. [2019-12-27 02:34:03,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:34:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61068 states and 232467 transitions. [2019-12-27 02:34:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:34:03,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:03,386 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] [2019-12-27 02:34:03,386 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-27 02:34:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash -779914948, now seen corresponding path program 1 times [2019-12-27 02:34:03,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:03,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685380322] [2019-12-27 02:34:03,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:03,567 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-27 02:34:03,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685380322] [2019-12-27 02:34:03,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:03,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:34:03,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360910954] [2019-12-27 02:34:03,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:34:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:34:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:03,569 INFO L87 Difference]: Start difference. First operand 61068 states and 232467 transitions. Second operand 10 states. [2019-12-27 02:34:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:04,566 INFO L93 Difference]: Finished difference Result 101963 states and 386666 transitions. [2019-12-27 02:34:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:34:04,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-12-27 02:34:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:04,768 INFO L225 Difference]: With dead ends: 101963 [2019-12-27 02:34:04,769 INFO L226 Difference]: Without dead ends: 88747 [2019-12-27 02:34:04,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:34:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88747 states. [2019-12-27 02:34:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88747 to 57718. [2019-12-27 02:34:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57718 states. [2019-12-27 02:34:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57718 states to 57718 states and 217599 transitions. [2019-12-27 02:34:06,702 INFO L78 Accepts]: Start accepts. Automaton has 57718 states and 217599 transitions. Word has length 39 [2019-12-27 02:34:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:06,702 INFO L462 AbstractCegarLoop]: Abstraction has 57718 states and 217599 transitions. [2019-12-27 02:34:06,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:34:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 57718 states and 217599 transitions. [2019-12-27 02:34:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:34:06,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:06,761 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] [2019-12-27 02:34:06,761 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-27 02:34:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash 134445563, now seen corresponding path program 1 times [2019-12-27 02:34:06,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:06,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219139322] [2019-12-27 02:34:06,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:07,170 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-27 02:34:07,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219139322] [2019-12-27 02:34:07,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:07,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:34:07,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958332650] [2019-12-27 02:34:07,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:34:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:34:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:34:07,172 INFO L87 Difference]: Start difference. First operand 57718 states and 217599 transitions. Second operand 12 states. [2019-12-27 02:34:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:10,072 INFO L93 Difference]: Finished difference Result 102983 states and 393566 transitions. [2019-12-27 02:34:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:34:10,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-12-27 02:34:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:10,291 INFO L225 Difference]: With dead ends: 102983 [2019-12-27 02:34:10,292 INFO L226 Difference]: Without dead ends: 95717 [2019-12-27 02:34:10,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:34:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95717 states. [2019-12-27 02:34:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95717 to 69819. [2019-12-27 02:34:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69819 states. [2019-12-27 02:34:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69819 states to 69819 states and 267130 transitions. [2019-12-27 02:34:12,629 INFO L78 Accepts]: Start accepts. Automaton has 69819 states and 267130 transitions. Word has length 39 [2019-12-27 02:34:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:12,629 INFO L462 AbstractCegarLoop]: Abstraction has 69819 states and 267130 transitions. [2019-12-27 02:34:12,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:34:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 69819 states and 267130 transitions. [2019-12-27 02:34:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:34:12,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:12,699 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] [2019-12-27 02:34:12,699 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-27 02:34:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -757478390, now seen corresponding path program 1 times [2019-12-27 02:34:12,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:12,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58882676] [2019-12-27 02:34:12,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:12,765 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-27 02:34:12,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58882676] [2019-12-27 02:34:12,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:12,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:34:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696173579] [2019-12-27 02:34:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:34:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:34:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:34:12,767 INFO L87 Difference]: Start difference. First operand 69819 states and 267130 transitions. Second operand 5 states. [2019-12-27 02:34:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:12,880 INFO L93 Difference]: Finished difference Result 21315 states and 67618 transitions. [2019-12-27 02:34:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:34:12,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:34:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:12,909 INFO L225 Difference]: With dead ends: 21315 [2019-12-27 02:34:12,910 INFO L226 Difference]: Without dead ends: 20409 [2019-12-27 02:34:12,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:34:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20409 states. [2019-12-27 02:34:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20409 to 20409. [2019-12-27 02:34:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-27 02:34:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 64720 transitions. [2019-12-27 02:34:13,213 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 64720 transitions. Word has length 39 [2019-12-27 02:34:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:13,213 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 64720 transitions. [2019-12-27 02:34:13,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:34:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 64720 transitions. [2019-12-27 02:34:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:34:13,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:13,227 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] [2019-12-27 02:34:13,227 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-27 02:34:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-27 02:34:13,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:13,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93839678] [2019-12-27 02:34:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:13,317 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-27 02:34:13,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93839678] [2019-12-27 02:34:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:13,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:34:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175282037] [2019-12-27 02:34:13,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:13,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:13,320 INFO L87 Difference]: Start difference. First operand 20409 states and 64720 transitions. Second operand 6 states. [2019-12-27 02:34:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:13,397 INFO L93 Difference]: Finished difference Result 3724 states and 9403 transitions. [2019-12-27 02:34:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:34:13,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 02:34:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:13,401 INFO L225 Difference]: With dead ends: 3724 [2019-12-27 02:34:13,401 INFO L226 Difference]: Without dead ends: 3353 [2019-12-27 02:34:13,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-12-27 02:34:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3353. [2019-12-27 02:34:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2019-12-27 02:34:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 8355 transitions. [2019-12-27 02:34:13,435 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 8355 transitions. Word has length 41 [2019-12-27 02:34:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:13,435 INFO L462 AbstractCegarLoop]: Abstraction has 3353 states and 8355 transitions. [2019-12-27 02:34:13,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 8355 transitions. [2019-12-27 02:34:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:34:13,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:13,438 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] [2019-12-27 02:34:13,438 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-27 02:34:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-27 02:34:13,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:13,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058226947] [2019-12-27 02:34:13,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:13,530 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-27 02:34:13,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058226947] [2019-12-27 02:34:13,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:13,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:34:13,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820765298] [2019-12-27 02:34:13,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:34:13,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:34:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:34:13,533 INFO L87 Difference]: Start difference. First operand 3353 states and 8355 transitions. Second operand 7 states. [2019-12-27 02:34:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:13,624 INFO L93 Difference]: Finished difference Result 1347 states and 3725 transitions. [2019-12-27 02:34:13,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:34:13,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:34:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:13,628 INFO L225 Difference]: With dead ends: 1347 [2019-12-27 02:34:13,628 INFO L226 Difference]: Without dead ends: 1297 [2019-12-27 02:34:13,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:34:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-27 02:34:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1057. [2019-12-27 02:34:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-12-27 02:34:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2906 transitions. [2019-12-27 02:34:13,646 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2906 transitions. Word has length 48 [2019-12-27 02:34:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:13,647 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 2906 transitions. [2019-12-27 02:34:13,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:34:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2906 transitions. [2019-12-27 02:34:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:34:13,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:13,648 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-27 02:34:13,648 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-27 02:34:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-27 02:34:13,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:13,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792147740] [2019-12-27 02:34:13,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:13,743 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-27 02:34:13,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792147740] [2019-12-27 02:34:13,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:13,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:13,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900466643] [2019-12-27 02:34:13,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:13,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:13,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:13,752 INFO L87 Difference]: Start difference. First operand 1057 states and 2906 transitions. Second operand 3 states. [2019-12-27 02:34:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:13,775 INFO L93 Difference]: Finished difference Result 1011 states and 2723 transitions. [2019-12-27 02:34:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:13,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 02:34:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:13,778 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 02:34:13,778 INFO L226 Difference]: Without dead ends: 1011 [2019-12-27 02:34:13,780 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-27 02:34:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-27 02:34:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2019-12-27 02:34:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-12-27 02:34:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2723 transitions. [2019-12-27 02:34:13,802 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2723 transitions. Word has length 59 [2019-12-27 02:34:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:13,802 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 2723 transitions. [2019-12-27 02:34:13,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2723 transitions. [2019-12-27 02:34:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:34:13,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:13,805 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-27 02:34:13,805 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-27 02:34:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 1 times [2019-12-27 02:34:13,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:13,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702446753] [2019-12-27 02:34:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:14,090 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-27 02:34:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702446753] [2019-12-27 02:34:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:14,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:34:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734918330] [2019-12-27 02:34:14,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:34:14,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:34:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:34:14,092 INFO L87 Difference]: Start difference. First operand 1011 states and 2723 transitions. Second operand 13 states. [2019-12-27 02:34:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:14,998 INFO L93 Difference]: Finished difference Result 1849 states and 4773 transitions. [2019-12-27 02:34:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:34:14,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 02:34:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:15,002 INFO L225 Difference]: With dead ends: 1849 [2019-12-27 02:34:15,002 INFO L226 Difference]: Without dead ends: 1441 [2019-12-27 02:34:15,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:34:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2019-12-27 02:34:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1041. [2019-12-27 02:34:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-12-27 02:34:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2802 transitions. [2019-12-27 02:34:15,015 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 2802 transitions. Word has length 60 [2019-12-27 02:34:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:15,016 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 2802 transitions. [2019-12-27 02:34:15,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:34:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 2802 transitions. [2019-12-27 02:34:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:34:15,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:15,017 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-27 02:34:15,017 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash -908704936, now seen corresponding path program 2 times [2019-12-27 02:34:15,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:15,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038522983] [2019-12-27 02:34:15,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:15,120 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-27 02:34:15,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038522983] [2019-12-27 02:34:15,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:15,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:34:15,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071657938] [2019-12-27 02:34:15,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:15,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:15,122 INFO L87 Difference]: Start difference. First operand 1041 states and 2802 transitions. Second operand 6 states. [2019-12-27 02:34:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:15,189 INFO L93 Difference]: Finished difference Result 1551 states and 3905 transitions. [2019-12-27 02:34:15,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:34:15,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 02:34:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:15,191 INFO L225 Difference]: With dead ends: 1551 [2019-12-27 02:34:15,191 INFO L226 Difference]: Without dead ends: 577 [2019-12-27 02:34:15,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-27 02:34:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2019-12-27 02:34:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-27 02:34:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1240 transitions. [2019-12-27 02:34:15,198 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1240 transitions. Word has length 60 [2019-12-27 02:34:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:15,198 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1240 transitions. [2019-12-27 02:34:15,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1240 transitions. [2019-12-27 02:34:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:34:15,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:15,199 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-27 02:34:15,199 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 3 times [2019-12-27 02:34:15,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:15,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117071751] [2019-12-27 02:34:15,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:15,435 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-27 02:34:15,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117071751] [2019-12-27 02:34:15,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:15,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:34:15,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987892985] [2019-12-27 02:34:15,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:34:15,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:34:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:34:15,437 INFO L87 Difference]: Start difference. First operand 571 states and 1240 transitions. Second operand 12 states. [2019-12-27 02:34:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:15,987 INFO L93 Difference]: Finished difference Result 922 states and 2013 transitions. [2019-12-27 02:34:15,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:34:15,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 02:34:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:15,989 INFO L225 Difference]: With dead ends: 922 [2019-12-27 02:34:15,989 INFO L226 Difference]: Without dead ends: 700 [2019-12-27 02:34:15,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:34:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-27 02:34:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 587. [2019-12-27 02:34:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 02:34:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1270 transitions. [2019-12-27 02:34:15,996 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1270 transitions. Word has length 60 [2019-12-27 02:34:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:15,997 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1270 transitions. [2019-12-27 02:34:15,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:34:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1270 transitions. [2019-12-27 02:34:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:34:15,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:15,998 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-27 02:34:15,998 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1887301962, now seen corresponding path program 4 times [2019-12-27 02:34:15,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:15,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12426929] [2019-12-27 02:34:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:34:16,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12426929] [2019-12-27 02:34:16,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:16,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:34:16,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968272546] [2019-12-27 02:34:16,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:34:16,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:16,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:34:16,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:34:16,267 INFO L87 Difference]: Start difference. First operand 587 states and 1270 transitions. Second operand 13 states. [2019-12-27 02:34:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:16,780 INFO L93 Difference]: Finished difference Result 798 states and 1705 transitions. [2019-12-27 02:34:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:34:16,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 02:34:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:16,782 INFO L225 Difference]: With dead ends: 798 [2019-12-27 02:34:16,782 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:34:16,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:34:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:34:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 539. [2019-12-27 02:34:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 02:34:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1158 transitions. [2019-12-27 02:34:16,790 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1158 transitions. Word has length 60 [2019-12-27 02:34:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:16,791 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1158 transitions. [2019-12-27 02:34:16,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:34:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1158 transitions. [2019-12-27 02:34:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:34:16,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:16,792 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-27 02:34:16,792 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 5 times [2019-12-27 02:34:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:16,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222066497] [2019-12-27 02:34:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:34:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:34:16,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:34:16,926 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:34:16,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.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, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~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_#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, ULTIMATE.start_main_~#t1144~0.base, ~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_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~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_#t~ite38, ULTIMATE.start_main_~#t1142~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_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:34:16,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-27 02:34:16,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-27 02:34:16,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 02:34:16,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~a~0_Out-480137097 1) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-480137097 0)) (= ~__unbuffered_p3_EBX~0_Out-480137097 ~b~0_In-480137097) (= ~a~0_Out-480137097 ~__unbuffered_p3_EAX~0_Out-480137097) (= ~z$r_buff0_thd4~0_Out-480137097 1) (= ~z$r_buff0_thd1~0_In-480137097 ~z$r_buff1_thd1~0_Out-480137097) (= ~z$r_buff1_thd2~0_Out-480137097 ~z$r_buff0_thd2~0_In-480137097) (= ~z$r_buff0_thd4~0_In-480137097 ~z$r_buff1_thd4~0_Out-480137097) (= ~z$r_buff0_thd0~0_In-480137097 ~z$r_buff1_thd0~0_Out-480137097) (= ~z$r_buff1_thd3~0_Out-480137097 ~z$r_buff0_thd3~0_In-480137097)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-480137097, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-480137097, ~b~0=~b~0_In-480137097, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-480137097, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-480137097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-480137097, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480137097} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-480137097, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-480137097, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-480137097, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-480137097, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-480137097, ~a~0=~a~0_Out-480137097, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-480137097, ~b~0=~b~0_In-480137097, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-480137097, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-480137097, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-480137097, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-480137097, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-480137097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-480137097, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-480137097} 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-27 02:34:16,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:34:16,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:34:16,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1839899983 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1839899983 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1839899983| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1839899983| ~z$w_buff0_used~0_In1839899983)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1839899983, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1839899983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1839899983, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1839899983, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1839899983|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:34:16,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2075736562 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2075736562 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2075736562 |P2Thread1of1ForFork2_#t~ite3_Out2075736562|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In2075736562 |P2Thread1of1ForFork2_#t~ite3_Out2075736562|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2075736562, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2075736562, ~z$w_buff1~0=~z$w_buff1~0_In2075736562, ~z~0=~z~0_In2075736562} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2075736562|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2075736562, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2075736562, ~z$w_buff1~0=~z$w_buff1~0_In2075736562, ~z~0=~z~0_In2075736562} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:34:16,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 02:34:16,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In490136750 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In490136750 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out490136750| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In490136750 |P2Thread1of1ForFork2_#t~ite5_Out490136750|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In490136750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In490136750} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out490136750|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In490136750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In490136750} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:34:16,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-137946548 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-137946548 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-137946548 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-137946548 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-137946548 |P2Thread1of1ForFork2_#t~ite6_Out-137946548|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-137946548|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-137946548, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-137946548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137946548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-137946548} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-137946548|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137946548, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-137946548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137946548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-137946548} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:34:16,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In395614348 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In395614348 256) 0))) (or (and (= ~z$r_buff0_thd3~0_In395614348 |P2Thread1of1ForFork2_#t~ite7_Out395614348|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out395614348|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In395614348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In395614348} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In395614348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In395614348, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out395614348|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:34:16,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1126630826 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1126630826 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1126630826 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1126630826 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1126630826|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1126630826 |P2Thread1of1ForFork2_#t~ite8_Out-1126630826|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126630826, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1126630826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1126630826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1126630826} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126630826, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1126630826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1126630826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1126630826, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1126630826|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:34:16,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} 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-27 02:34:16,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In527518111 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In527518111 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In527518111 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In527518111 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out527518111| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In527518111 |P3Thread1of1ForFork3_#t~ite12_Out527518111|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In527518111, ~z$w_buff0_used~0=~z$w_buff0_used~0_In527518111, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In527518111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In527518111} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In527518111, ~z$w_buff0_used~0=~z$w_buff0_used~0_In527518111, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In527518111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In527518111, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out527518111|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 02:34:16,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1933344664 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1933344664 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1933344664 ~z$r_buff0_thd4~0_In1933344664)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out1933344664) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1933344664, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1933344664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1933344664, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1933344664, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1933344664|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 02:34:16,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1539928639 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1539928639 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1539928639 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1539928639 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1539928639| ~z$r_buff1_thd4~0_In1539928639)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1539928639|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1539928639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1539928639, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1539928639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1539928639} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1539928639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1539928639, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1539928639|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1539928639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1539928639} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 02:34:16,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, 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-27 02:34:16,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:34:16,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out306044629| |ULTIMATE.start_main_#t~ite20_Out306044629|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In306044629 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In306044629 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In306044629 |ULTIMATE.start_main_#t~ite19_Out306044629|) (not .cse1) (not .cse2)) (and (= ~z~0_In306044629 |ULTIMATE.start_main_#t~ite19_Out306044629|) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In306044629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306044629, ~z$w_buff1~0=~z$w_buff1~0_In306044629, ~z~0=~z~0_In306044629} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out306044629|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In306044629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306044629, ~z$w_buff1~0=~z$w_buff1~0_In306044629, ~z~0=~z~0_In306044629, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out306044629|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:34:16,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-626749834 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-626749834 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-626749834| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-626749834| ~z$w_buff0_used~0_In-626749834)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-626749834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-626749834} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-626749834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-626749834, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-626749834|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:34:16,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1928178905 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1928178905 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1928178905 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1928178905 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1928178905|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1928178905 |ULTIMATE.start_main_#t~ite22_Out1928178905|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1928178905, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1928178905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1928178905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1928178905} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1928178905, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1928178905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1928178905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1928178905, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1928178905|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:34:16,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In368028903 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In368028903 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out368028903| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out368028903| ~z$r_buff0_thd0~0_In368028903)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In368028903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In368028903} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In368028903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In368028903, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out368028903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:34:16,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1711497352 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1711497352 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1711497352 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1711497352 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1711497352| ~z$r_buff1_thd0~0_In1711497352) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out1711497352| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1711497352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1711497352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1711497352, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711497352} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1711497352, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1711497352, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1711497352, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1711497352|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1711497352} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:34:16,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1156168596 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_In1156168596| |ULTIMATE.start_main_#t~ite36_Out1156168596|) (= |ULTIMATE.start_main_#t~ite37_Out1156168596| ~z$w_buff0_used~0_In1156168596) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite36_Out1156168596| |ULTIMATE.start_main_#t~ite37_Out1156168596|) (= |ULTIMATE.start_main_#t~ite36_Out1156168596| ~z$w_buff0_used~0_In1156168596) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1156168596 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1156168596 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1156168596 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1156168596 256))))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156168596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156168596, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1156168596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1156168596, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In1156168596|, ~weak$$choice2~0=~weak$$choice2~0_In1156168596} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1156168596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1156168596, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1156168596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1156168596, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1156168596|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1156168596|, ~weak$$choice2~0=~weak$$choice2~0_In1156168596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:34:16,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1368243048 256) 0))) (or (and (= ~z$w_buff1_used~0_In1368243048 |ULTIMATE.start_main_#t~ite40_Out1368243048|) (= |ULTIMATE.start_main_#t~ite39_In1368243048| |ULTIMATE.start_main_#t~ite39_Out1368243048|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out1368243048| |ULTIMATE.start_main_#t~ite40_Out1368243048|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1368243048 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1368243048 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1368243048 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1368243048 256) 0)))) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out1368243048| ~z$w_buff1_used~0_In1368243048)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1368243048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368243048, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1368243048|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1368243048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368243048, ~weak$$choice2~0=~weak$$choice2~0_In1368243048} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1368243048, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1368243048|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1368243048|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368243048, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1368243048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368243048, ~weak$$choice2~0=~weak$$choice2~0_In1368243048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:34:16,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} 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-27 02:34:16,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, 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-27 02:34:16,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:34:17,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:34:17 BasicIcfg [2019-12-27 02:34:17,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:34:17,043 INFO L168 Benchmark]: Toolchain (without parser) took 72876.65 ms. Allocated memory was 148.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 632.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,043 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.41 ms. Allocated memory was 148.4 MB in the beginning and 204.5 MB in the end (delta: 56.1 MB). Free memory was 104.5 MB in the beginning and 158.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.71 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,045 INFO L168 Benchmark]: Boogie Preprocessor took 40.45 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,046 INFO L168 Benchmark]: RCFGBuilder took 862.89 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 102.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,046 INFO L168 Benchmark]: TraceAbstraction took 71085.17 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 574.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:34:17,049 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.50 ms. Allocated memory is still 148.4 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.41 ms. Allocated memory was 148.4 MB in the beginning and 204.5 MB in the end (delta: 56.1 MB). Free memory was 104.5 MB in the beginning and 158.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.71 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.45 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.89 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 102.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71085.17 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 574.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L837] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L839] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L841] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L812] 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) [L776] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 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] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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 = !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) [L859] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L859] 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)) [L860] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L860] 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)) [L861] 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)) [L862] 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)) [L864] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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] [L864] 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)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=1, 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, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3420 SDtfs, 4923 SDslu, 11292 SDs, 0 SdLazy, 5102 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69819occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 147444 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 194114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...