/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/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:25:15,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:25:16,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:25:16,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:25:16,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:25:16,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:25:16,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:25:16,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:25:16,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:25:16,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:25:16,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:25:16,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:25:16,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:25:16,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:25:16,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:25:16,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:25:16,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:25:16,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:25:16,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:25:16,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:25:16,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:25:16,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:25:16,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:25:16,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:25:16,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:25:16,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:25:16,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:25:16,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:25:16,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:25:16,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:25:16,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:25:16,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:25:16,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:25:16,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:25:16,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:25:16,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:25:16,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:25:16,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:25:16,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:25:16,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:25:16,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:25:16,057 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:25:16,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:25:16,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:25:16,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:25:16,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:25:16,086 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:25:16,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:25:16,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:25:16,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:25:16,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:25:16,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:25:16,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:25:16,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:25:16,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:25:16,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:25:16,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:25:16,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:25:16,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:25:16,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:25:16,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:25:16,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:25:16,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:25:16,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:25:16,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:25:16,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:25:16,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:25:16,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:25:16,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:25:16,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:25:16,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:25:16,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:25:16,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:25:16,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:25:16,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:25:16,423 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:25:16,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 02:25:16,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae233770/0493da40fa534ed89086cae9edad3577/FLAG7e8898290 [2019-12-27 02:25:17,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:25:17,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 02:25:17,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae233770/0493da40fa534ed89086cae9edad3577/FLAG7e8898290 [2019-12-27 02:25:17,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae233770/0493da40fa534ed89086cae9edad3577 [2019-12-27 02:25:17,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:25:17,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:25:17,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:17,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:25:17,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:25:17,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:17" (1/1) ... [2019-12-27 02:25:17,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cdc2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:17, skipping insertion in model container [2019-12-27 02:25:17,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:25:17" (1/1) ... [2019-12-27 02:25:17,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:25:17,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:25:17,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:17,907 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:25:17,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:25:18,077 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:25:18,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18 WrapperNode [2019-12-27 02:25:18,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:25:18,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:18,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:25:18,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:25:18,088 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:25:18" (1/1) ... [2019-12-27 02:25:18,115 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:25:18" (1/1) ... [2019-12-27 02:25:18,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:25:18,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:25:18,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:25:18,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:25:18,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (1/1) ... [2019-12-27 02:25:18,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:25:18,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:25:18,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:25:18,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:25:18,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (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:25:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:25:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:25:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:25:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:25:18,249 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:25:18,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:25:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:25:18,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:25:18,250 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:25:18,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:25:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:25:18,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:25:18,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:25:18,253 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:25:19,035 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:25:19,035 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:25:19,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:19 BoogieIcfgContainer [2019-12-27 02:25:19,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:25:19,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:25:19,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:25:19,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:25:19,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:25:17" (1/3) ... [2019-12-27 02:25:19,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29296f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:19, skipping insertion in model container [2019-12-27 02:25:19,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:25:18" (2/3) ... [2019-12-27 02:25:19,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29296f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:25:19, skipping insertion in model container [2019-12-27 02:25:19,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:25:19" (3/3) ... [2019-12-27 02:25:19,046 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-27 02:25:19,057 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:25:19,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:25:19,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:25:19,065 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:25:19,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,146 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,146 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:25:19,202 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:25:19,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:25:19,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:25:19,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:25:19,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:25:19,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:25:19,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:25:19,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:25:19,224 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:25:19,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 02:25:19,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:25:19,347 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:25:19,347 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:19,367 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:25:19,396 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 02:25:19,455 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 02:25:19,455 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:25:19,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:25:19,491 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:25:19,493 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:25:24,792 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 02:25:25,115 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 02:25:25,228 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 02:25:25,258 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 02:25:25,258 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 02:25:25,262 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 02:25:39,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 02:25:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 02:25:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:25:39,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:39,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:25:39,429 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 02:25:39,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:39,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473427444] [2019-12-27 02:25:39,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:39,671 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:25:39,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473427444] [2019-12-27 02:25:39,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:39,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:25:39,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317891340] [2019-12-27 02:25:39,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:25:39,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:39,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:25:39,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:25:39,697 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 02:25:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:42,133 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 02:25:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:25:42,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:25:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:42,673 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 02:25:42,673 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 02:25:42,674 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:25:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 02:25:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 02:25:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 02:25:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 02:25:51,178 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 02:25:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:25:51,179 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 02:25:51,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:25:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 02:25:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:25:51,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:25:51,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:25:51,184 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:25:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:25:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 02:25:51,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:25:51,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825722729] [2019-12-27 02:25:51,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:25:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:25:51,295 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:25:51,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825722729] [2019-12-27 02:25:51,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:25:51,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:25:51,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076721599] [2019-12-27 02:25:51,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:25:51,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:25:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:25:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:25:51,300 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 02:25:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:25:56,419 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 02:25:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:25:56,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:25:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:25:56,995 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 02:25:56,995 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 02:25:56,996 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:26:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 02:26:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 02:26:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 02:26:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 02:26:09,737 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 02:26:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:09,738 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 02:26:09,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 02:26:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:26:09,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:09,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:09,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 02:26:09,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:09,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356652615] [2019-12-27 02:26:09,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:09,807 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:26:09,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356652615] [2019-12-27 02:26:09,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:09,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:09,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072986213] [2019-12-27 02:26:09,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:09,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:09,810 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 02:26:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:09,940 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 02:26:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:09,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:26:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:09,992 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 02:26:09,992 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 02:26:09,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 02:26:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 02:26:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 02:26:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 02:26:10,642 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 02:26:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:10,642 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 02:26:10,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 02:26:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:26:10,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:10,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:10,645 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 02:26:10,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:10,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999604025] [2019-12-27 02:26:10,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:10,780 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:26:10,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999604025] [2019-12-27 02:26:10,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:10,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:10,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396457651] [2019-12-27 02:26:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:10,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:10,783 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 02:26:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:12,205 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 02:26:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:12,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:26:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:12,272 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 02:26:12,272 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 02:26:12,272 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:26:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 02:26:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 02:26:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 02:26:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 02:26:12,921 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 02:26:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:12,923 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 02:26:12,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 02:26:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:26:12,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:12,934 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] [2019-12-27 02:26:12,934 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 02:26:12,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:12,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54965846] [2019-12-27 02:26:12,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:13,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54965846] [2019-12-27 02:26:13,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:13,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:13,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294561909] [2019-12-27 02:26:13,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:26:13,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:26:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:13,022 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-27 02:26:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:13,616 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-27 02:26:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:26:13,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:26:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:13,687 INFO L225 Difference]: With dead ends: 44779 [2019-12-27 02:26:13,688 INFO L226 Difference]: Without dead ends: 44772 [2019-12-27 02:26:13,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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:26:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-27 02:26:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-27 02:26:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 02:26:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 02:26:16,287 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 02:26:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:16,287 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 02:26:16,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:26:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 02:26:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:26:16,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:16,300 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] [2019-12-27 02:26:16,300 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 02:26:16,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:16,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117817177] [2019-12-27 02:26:16,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:16,356 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:26:16,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117817177] [2019-12-27 02:26:16,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:16,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:16,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119123170] [2019-12-27 02:26:16,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:16,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:16,359 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-27 02:26:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:16,423 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 02:26:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:26:16,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:26:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:16,442 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 02:26:16,442 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 02:26:16,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 02:26:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 02:26:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 02:26:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 02:26:16,647 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 02:26:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:16,647 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 02:26:16,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 02:26:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:26:16,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:16,657 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] [2019-12-27 02:26:16,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 02:26:16,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:16,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232213058] [2019-12-27 02:26:16,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:16,708 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:26:16,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232213058] [2019-12-27 02:26:16,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:16,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:16,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532263720] [2019-12-27 02:26:16,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:16,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:16,711 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 02:26:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:16,818 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 02:26:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:16,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:26:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:16,853 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 02:26:16,853 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 02:26:16,854 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:26:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 02:26:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 02:26:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 02:26:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 02:26:17,113 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 02:26:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:17,113 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 02:26:17,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 02:26:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:26:17,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:17,126 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] [2019-12-27 02:26:17,126 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 02:26:17,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:17,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324869684] [2019-12-27 02:26:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:17,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324869684] [2019-12-27 02:26:17,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:17,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:17,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883115942] [2019-12-27 02:26:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:17,173 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 02:26:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:17,274 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 02:26:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:17,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:26:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:17,301 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 02:26:17,301 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 02:26:17,301 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:26:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 02:26:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 02:26:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 02:26:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 02:26:17,575 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 02:26:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:17,576 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 02:26:17,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 02:26:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:26:17,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:17,588 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] [2019-12-27 02:26:17,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 02:26:17,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:17,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104150232] [2019-12-27 02:26:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:17,676 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:26:17,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104150232] [2019-12-27 02:26:17,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:17,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:17,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667800562] [2019-12-27 02:26:17,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:26:17,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:26:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:17,678 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 02:26:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:18,549 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 02:26:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:26:18,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:26:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:18,593 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 02:26:18,593 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 02:26:18,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 02:26:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 02:26:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 02:26:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 02:26:18,946 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 02:26:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:18,946 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 02:26:18,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:26:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 02:26:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:26:18,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:18,959 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] [2019-12-27 02:26:18,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 02:26:18,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:18,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480452273] [2019-12-27 02:26:18,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:19,071 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:26:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480452273] [2019-12-27 02:26:19,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:19,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637147036] [2019-12-27 02:26:19,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:26:19,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:26:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:19,073 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 02:26:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:19,704 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-27 02:26:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:26:19,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 02:26:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:19,745 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 02:26:19,745 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 02:26:19,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 02:26:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-27 02:26:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-27 02:26:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-27 02:26:20,095 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-27 02:26:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:20,095 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-27 02:26:20,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:26:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-27 02:26:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:26:20,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:20,114 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] [2019-12-27 02:26:20,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 02:26:20,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:20,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66299279] [2019-12-27 02:26:20,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:20,219 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:26:20,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66299279] [2019-12-27 02:26:20,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:20,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:20,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163789246] [2019-12-27 02:26:20,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:20,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:20,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:20,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:20,221 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-27 02:26:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:21,429 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-27 02:26:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:26:21,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:26:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:21,504 INFO L225 Difference]: With dead ends: 38372 [2019-12-27 02:26:21,504 INFO L226 Difference]: Without dead ends: 38372 [2019-12-27 02:26:21,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:26:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-27 02:26:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-27 02:26:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-27 02:26:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-27 02:26:22,186 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-27 02:26:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:22,186 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-27 02:26:22,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-27 02:26:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:26:22,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:22,206 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] [2019-12-27 02:26:22,206 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:22,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:22,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 02:26:22,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:22,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841308019] [2019-12-27 02:26:22,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:22,331 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:26:22,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841308019] [2019-12-27 02:26:22,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:22,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:22,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337733975] [2019-12-27 02:26:22,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:26:22,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:26:22,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:26:22,334 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-27 02:26:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:24,151 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-27 02:26:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:26:24,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 02:26:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:24,215 INFO L225 Difference]: With dead ends: 45317 [2019-12-27 02:26:24,215 INFO L226 Difference]: Without dead ends: 45317 [2019-12-27 02:26:24,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:26:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-27 02:26:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-27 02:26:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-27 02:26:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-27 02:26:24,688 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-27 02:26:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:24,689 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-27 02:26:24,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:26:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-27 02:26:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:26:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:24,705 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] [2019-12-27 02:26:24,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-27 02:26:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:24,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214186999] [2019-12-27 02:26:24,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:24,819 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:26:24,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214186999] [2019-12-27 02:26:24,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:24,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:24,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521517814] [2019-12-27 02:26:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:24,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:24,821 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-27 02:26:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:26,190 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-27 02:26:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:26:26,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:26:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:26,240 INFO L225 Difference]: With dead ends: 34977 [2019-12-27 02:26:26,240 INFO L226 Difference]: Without dead ends: 34977 [2019-12-27 02:26:26,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:26:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-27 02:26:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-27 02:26:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-27 02:26:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-27 02:26:26,879 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-27 02:26:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:26,880 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-27 02:26:26,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-27 02:26:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:26:26,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:26,897 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] [2019-12-27 02:26:26,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-27 02:26:26,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:26,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797997045] [2019-12-27 02:26:26,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:26,996 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:26:26,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797997045] [2019-12-27 02:26:26,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:26,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:26,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821901134] [2019-12-27 02:26:26,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:26,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:26,998 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-27 02:26:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:28,254 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-27 02:26:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:26:28,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 02:26:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:28,317 INFO L225 Difference]: With dead ends: 43257 [2019-12-27 02:26:28,318 INFO L226 Difference]: Without dead ends: 43257 [2019-12-27 02:26:28,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:26:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-27 02:26:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-27 02:26:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-27 02:26:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-27 02:26:28,757 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-27 02:26:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:28,757 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-27 02:26:28,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-27 02:26:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:26:28,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:28,772 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] [2019-12-27 02:26:28,772 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:28,773 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-27 02:26:28,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:28,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837392208] [2019-12-27 02:26:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:28,892 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:26:28,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837392208] [2019-12-27 02:26:28,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:28,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:28,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507897110] [2019-12-27 02:26:28,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:26:28,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:26:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:26:28,894 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-27 02:26:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:30,505 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-27 02:26:30,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:26:30,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 02:26:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:30,573 INFO L225 Difference]: With dead ends: 39307 [2019-12-27 02:26:30,574 INFO L226 Difference]: Without dead ends: 39307 [2019-12-27 02:26:30,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:26:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-27 02:26:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-27 02:26:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-27 02:26:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-27 02:26:31,220 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-27 02:26:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:31,220 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-27 02:26:31,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:26:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-27 02:26:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:26:31,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:31,241 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:26:31,241 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-27 02:26:31,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:31,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265777958] [2019-12-27 02:26:31,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:31,287 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:26:31,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265777958] [2019-12-27 02:26:31,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:31,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:26:31,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328574] [2019-12-27 02:26:31,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:31,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:31,289 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-27 02:26:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:31,352 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-27 02:26:31,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:31,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:26:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:31,377 INFO L225 Difference]: With dead ends: 16672 [2019-12-27 02:26:31,377 INFO L226 Difference]: Without dead ends: 16672 [2019-12-27 02:26:31,377 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:26:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-27 02:26:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-27 02:26:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-27 02:26:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-27 02:26:31,617 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-27 02:26:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:31,617 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-27 02:26:31,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-27 02:26:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:26:31,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:31,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:31,640 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-27 02:26:31,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:31,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813150516] [2019-12-27 02:26:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:26:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813150516] [2019-12-27 02:26:31,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:31,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:31,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851569105] [2019-12-27 02:26:31,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:26:31,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:26:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:31,700 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-27 02:26:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:32,343 INFO L93 Difference]: Finished difference Result 24748 states and 73091 transitions. [2019-12-27 02:26:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:26:32,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:26:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:32,403 INFO L225 Difference]: With dead ends: 24748 [2019-12-27 02:26:32,403 INFO L226 Difference]: Without dead ends: 24748 [2019-12-27 02:26:32,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24748 states. [2019-12-27 02:26:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24748 to 22823. [2019-12-27 02:26:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22823 states. [2019-12-27 02:26:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22823 states to 22823 states and 67863 transitions. [2019-12-27 02:26:32,871 INFO L78 Accepts]: Start accepts. Automaton has 22823 states and 67863 transitions. Word has length 40 [2019-12-27 02:26:32,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:32,871 INFO L462 AbstractCegarLoop]: Abstraction has 22823 states and 67863 transitions. [2019-12-27 02:26:32,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:26:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22823 states and 67863 transitions. [2019-12-27 02:26:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:26:32,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:32,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:32,895 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-27 02:26:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:32,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191046842] [2019-12-27 02:26:32,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:32,941 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:26:32,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191046842] [2019-12-27 02:26:32,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:32,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:26:32,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653782099] [2019-12-27 02:26:32,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:26:32,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:26:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:32,943 INFO L87 Difference]: Start difference. First operand 22823 states and 67863 transitions. Second operand 5 states. [2019-12-27 02:26:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:33,051 INFO L93 Difference]: Finished difference Result 21512 states and 64877 transitions. [2019-12-27 02:26:33,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:26:33,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:26:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:33,100 INFO L225 Difference]: With dead ends: 21512 [2019-12-27 02:26:33,101 INFO L226 Difference]: Without dead ends: 21512 [2019-12-27 02:26:33,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21512 states. [2019-12-27 02:26:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21512 to 20553. [2019-12-27 02:26:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20553 states. [2019-12-27 02:26:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20553 states to 20553 states and 62291 transitions. [2019-12-27 02:26:33,747 INFO L78 Accepts]: Start accepts. Automaton has 20553 states and 62291 transitions. Word has length 40 [2019-12-27 02:26:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:33,747 INFO L462 AbstractCegarLoop]: Abstraction has 20553 states and 62291 transitions. [2019-12-27 02:26:33,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:26:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 20553 states and 62291 transitions. [2019-12-27 02:26:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:26:33,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:33,791 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, 1, 1, 1, 1] [2019-12-27 02:26:33,791 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-27 02:26:33,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903582810] [2019-12-27 02:26:33,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:33,998 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:26:33,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903582810] [2019-12-27 02:26:33,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:33,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:26:34,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367234194] [2019-12-27 02:26:34,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:26:34,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:26:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:34,001 INFO L87 Difference]: Start difference. First operand 20553 states and 62291 transitions. Second operand 9 states. [2019-12-27 02:26:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:35,779 INFO L93 Difference]: Finished difference Result 113167 states and 338070 transitions. [2019-12-27 02:26:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:26:35,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:26:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:35,932 INFO L225 Difference]: With dead ends: 113167 [2019-12-27 02:26:35,932 INFO L226 Difference]: Without dead ends: 102388 [2019-12-27 02:26:35,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:26:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102388 states. [2019-12-27 02:26:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102388 to 22199. [2019-12-27 02:26:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22199 states. [2019-12-27 02:26:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 67466 transitions. [2019-12-27 02:26:36,853 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 67466 transitions. Word has length 64 [2019-12-27 02:26:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:36,853 INFO L462 AbstractCegarLoop]: Abstraction has 22199 states and 67466 transitions. [2019-12-27 02:26:36,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:26:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 67466 transitions. [2019-12-27 02:26:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:26:36,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:36,875 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, 1, 1, 1, 1] [2019-12-27 02:26:36,876 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-27 02:26:36,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:36,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390983964] [2019-12-27 02:26:36,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:37,001 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:26:37,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390983964] [2019-12-27 02:26:37,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:37,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:26:37,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223112488] [2019-12-27 02:26:37,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:26:37,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:26:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:37,004 INFO L87 Difference]: Start difference. First operand 22199 states and 67466 transitions. Second operand 9 states. [2019-12-27 02:26:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:38,820 INFO L93 Difference]: Finished difference Result 124401 states and 369385 transitions. [2019-12-27 02:26:38,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 02:26:38,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:26:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:39,334 INFO L225 Difference]: With dead ends: 124401 [2019-12-27 02:26:39,334 INFO L226 Difference]: Without dead ends: 85486 [2019-12-27 02:26:39,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 02:26:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85486 states. [2019-12-27 02:26:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85486 to 24242. [2019-12-27 02:26:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24242 states. [2019-12-27 02:26:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24242 states to 24242 states and 73548 transitions. [2019-12-27 02:26:40,143 INFO L78 Accepts]: Start accepts. Automaton has 24242 states and 73548 transitions. Word has length 64 [2019-12-27 02:26:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:40,143 INFO L462 AbstractCegarLoop]: Abstraction has 24242 states and 73548 transitions. [2019-12-27 02:26:40,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:26:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24242 states and 73548 transitions. [2019-12-27 02:26:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:26:40,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:40,171 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, 1, 1, 1, 1] [2019-12-27 02:26:40,171 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-27 02:26:40,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:40,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477390199] [2019-12-27 02:26:40,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:40,254 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:26:40,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477390199] [2019-12-27 02:26:40,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:40,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:40,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873767322] [2019-12-27 02:26:40,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:40,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:40,256 INFO L87 Difference]: Start difference. First operand 24242 states and 73548 transitions. Second operand 7 states. [2019-12-27 02:26:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:40,800 INFO L93 Difference]: Finished difference Result 65697 states and 196530 transitions. [2019-12-27 02:26:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:26:40,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:26:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:40,875 INFO L225 Difference]: With dead ends: 65697 [2019-12-27 02:26:40,876 INFO L226 Difference]: Without dead ends: 48931 [2019-12-27 02:26:40,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:26:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48931 states. [2019-12-27 02:26:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48931 to 28935. [2019-12-27 02:26:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28935 states. [2019-12-27 02:26:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28935 states to 28935 states and 87711 transitions. [2019-12-27 02:26:41,514 INFO L78 Accepts]: Start accepts. Automaton has 28935 states and 87711 transitions. Word has length 64 [2019-12-27 02:26:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:41,514 INFO L462 AbstractCegarLoop]: Abstraction has 28935 states and 87711 transitions. [2019-12-27 02:26:41,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28935 states and 87711 transitions. [2019-12-27 02:26:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:26:41,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:41,545 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, 1, 1, 1, 1] [2019-12-27 02:26:41,545 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-27 02:26:41,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:41,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348687525] [2019-12-27 02:26:41,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:41,619 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:26:41,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348687525] [2019-12-27 02:26:41,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:41,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:26:41,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498100010] [2019-12-27 02:26:41,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:26:41,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:26:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:26:41,624 INFO L87 Difference]: Start difference. First operand 28935 states and 87711 transitions. Second operand 7 states. [2019-12-27 02:26:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:42,325 INFO L93 Difference]: Finished difference Result 60534 states and 179399 transitions. [2019-12-27 02:26:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:26:42,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:26:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:42,396 INFO L225 Difference]: With dead ends: 60534 [2019-12-27 02:26:42,396 INFO L226 Difference]: Without dead ends: 50677 [2019-12-27 02:26:42,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:26:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50677 states. [2019-12-27 02:26:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50677 to 28971. [2019-12-27 02:26:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28971 states. [2019-12-27 02:26:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28971 states to 28971 states and 87768 transitions. [2019-12-27 02:26:42,992 INFO L78 Accepts]: Start accepts. Automaton has 28971 states and 87768 transitions. Word has length 64 [2019-12-27 02:26:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:42,993 INFO L462 AbstractCegarLoop]: Abstraction has 28971 states and 87768 transitions. [2019-12-27 02:26:42,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:26:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 28971 states and 87768 transitions. [2019-12-27 02:26:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:26:43,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:43,022 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, 1, 1, 1, 1] [2019-12-27 02:26:43,023 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-27 02:26:43,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:43,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611227008] [2019-12-27 02:26:43,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:43,086 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:26:43,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611227008] [2019-12-27 02:26:43,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:43,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:43,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560553044] [2019-12-27 02:26:43,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:43,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:43,089 INFO L87 Difference]: Start difference. First operand 28971 states and 87768 transitions. Second operand 3 states. [2019-12-27 02:26:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:43,260 INFO L93 Difference]: Finished difference Result 33655 states and 101965 transitions. [2019-12-27 02:26:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:43,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:26:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:43,305 INFO L225 Difference]: With dead ends: 33655 [2019-12-27 02:26:43,306 INFO L226 Difference]: Without dead ends: 33655 [2019-12-27 02:26:43,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:26:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2019-12-27 02:26:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 29400. [2019-12-27 02:26:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29400 states. [2019-12-27 02:26:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29400 states to 29400 states and 89486 transitions. [2019-12-27 02:26:43,799 INFO L78 Accepts]: Start accepts. Automaton has 29400 states and 89486 transitions. Word has length 64 [2019-12-27 02:26:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:43,799 INFO L462 AbstractCegarLoop]: Abstraction has 29400 states and 89486 transitions. [2019-12-27 02:26:43,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 29400 states and 89486 transitions. [2019-12-27 02:26:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:43,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:43,833 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:43,833 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-27 02:26:43,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:43,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124891381] [2019-12-27 02:26:43,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:43,883 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:26:43,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124891381] [2019-12-27 02:26:43,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:43,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:43,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928371916] [2019-12-27 02:26:43,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:43,885 INFO L87 Difference]: Start difference. First operand 29400 states and 89486 transitions. Second operand 3 states. [2019-12-27 02:26:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:44,217 INFO L93 Difference]: Finished difference Result 38998 states and 119012 transitions. [2019-12-27 02:26:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:26:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:44,310 INFO L225 Difference]: With dead ends: 38998 [2019-12-27 02:26:44,310 INFO L226 Difference]: Without dead ends: 38998 [2019-12-27 02:26:44,311 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:26:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38998 states. [2019-12-27 02:26:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38998 to 30000. [2019-12-27 02:26:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30000 states. [2019-12-27 02:26:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30000 states to 30000 states and 91395 transitions. [2019-12-27 02:26:45,283 INFO L78 Accepts]: Start accepts. Automaton has 30000 states and 91395 transitions. Word has length 65 [2019-12-27 02:26:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:45,283 INFO L462 AbstractCegarLoop]: Abstraction has 30000 states and 91395 transitions. [2019-12-27 02:26:45,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 30000 states and 91395 transitions. [2019-12-27 02:26:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:45,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:45,313 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:45,314 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-27 02:26:45,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:45,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573418218] [2019-12-27 02:26:45,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:45,432 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:26:45,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573418218] [2019-12-27 02:26:45,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:45,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:26:45,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323219836] [2019-12-27 02:26:45,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:26:45,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:26:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:45,434 INFO L87 Difference]: Start difference. First operand 30000 states and 91395 transitions. Second operand 9 states. [2019-12-27 02:26:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:46,853 INFO L93 Difference]: Finished difference Result 102344 states and 302426 transitions. [2019-12-27 02:26:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:26:46,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:26:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:46,985 INFO L225 Difference]: With dead ends: 102344 [2019-12-27 02:26:46,985 INFO L226 Difference]: Without dead ends: 92281 [2019-12-27 02:26:46,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:26:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92281 states. [2019-12-27 02:26:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92281 to 30925. [2019-12-27 02:26:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30925 states. [2019-12-27 02:26:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30925 states to 30925 states and 94032 transitions. [2019-12-27 02:26:47,958 INFO L78 Accepts]: Start accepts. Automaton has 30925 states and 94032 transitions. Word has length 65 [2019-12-27 02:26:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:47,958 INFO L462 AbstractCegarLoop]: Abstraction has 30925 states and 94032 transitions. [2019-12-27 02:26:47,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:26:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 30925 states and 94032 transitions. [2019-12-27 02:26:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:47,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:47,993 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:47,993 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2044306796, now seen corresponding path program 2 times [2019-12-27 02:26:47,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:47,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003732852] [2019-12-27 02:26:47,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:48,092 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:26:48,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003732852] [2019-12-27 02:26:48,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:48,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:26:48,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545926964] [2019-12-27 02:26:48,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:26:48,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:26:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:26:48,095 INFO L87 Difference]: Start difference. First operand 30925 states and 94032 transitions. Second operand 9 states. [2019-12-27 02:26:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:49,755 INFO L93 Difference]: Finished difference Result 87072 states and 257707 transitions. [2019-12-27 02:26:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:26:49,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:26:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:49,882 INFO L225 Difference]: With dead ends: 87072 [2019-12-27 02:26:49,883 INFO L226 Difference]: Without dead ends: 82634 [2019-12-27 02:26:49,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:26:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82634 states. [2019-12-27 02:26:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82634 to 29489. [2019-12-27 02:26:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29489 states. [2019-12-27 02:26:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29489 states to 29489 states and 89558 transitions. [2019-12-27 02:26:50,768 INFO L78 Accepts]: Start accepts. Automaton has 29489 states and 89558 transitions. Word has length 65 [2019-12-27 02:26:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:50,768 INFO L462 AbstractCegarLoop]: Abstraction has 29489 states and 89558 transitions. [2019-12-27 02:26:50,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:26:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 29489 states and 89558 transitions. [2019-12-27 02:26:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:50,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:50,801 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:50,801 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:50,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1227831362, now seen corresponding path program 3 times [2019-12-27 02:26:50,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:50,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376248415] [2019-12-27 02:26:50,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:50,868 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:26:50,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376248415] [2019-12-27 02:26:50,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:50,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:26:50,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162244400] [2019-12-27 02:26:50,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:26:50,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:26:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:26:50,870 INFO L87 Difference]: Start difference. First operand 29489 states and 89558 transitions. Second operand 4 states. [2019-12-27 02:26:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:51,048 INFO L93 Difference]: Finished difference Result 29176 states and 88431 transitions. [2019-12-27 02:26:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:26:51,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:26:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:51,102 INFO L225 Difference]: With dead ends: 29176 [2019-12-27 02:26:51,103 INFO L226 Difference]: Without dead ends: 29176 [2019-12-27 02:26:51,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:26:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29176 states. [2019-12-27 02:26:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29176 to 27319. [2019-12-27 02:26:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27319 states. [2019-12-27 02:26:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27319 states to 27319 states and 82548 transitions. [2019-12-27 02:26:51,540 INFO L78 Accepts]: Start accepts. Automaton has 27319 states and 82548 transitions. Word has length 65 [2019-12-27 02:26:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:51,541 INFO L462 AbstractCegarLoop]: Abstraction has 27319 states and 82548 transitions. [2019-12-27 02:26:51,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:26:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27319 states and 82548 transitions. [2019-12-27 02:26:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:51,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:51,568 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:51,568 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1591414325, now seen corresponding path program 1 times [2019-12-27 02:26:51,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:51,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736662949] [2019-12-27 02:26:51,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:51,657 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:26:51,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736662949] [2019-12-27 02:26:51,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:51,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:26:51,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710938622] [2019-12-27 02:26:51,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:26:51,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:26:51,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:26:51,658 INFO L87 Difference]: Start difference. First operand 27319 states and 82548 transitions. Second operand 5 states. [2019-12-27 02:26:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:52,225 INFO L93 Difference]: Finished difference Result 36910 states and 109744 transitions. [2019-12-27 02:26:52,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:26:52,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 02:26:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:52,274 INFO L225 Difference]: With dead ends: 36910 [2019-12-27 02:26:52,274 INFO L226 Difference]: Without dead ends: 36690 [2019-12-27 02:26:52,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:26:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36690 states. [2019-12-27 02:26:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36690 to 31689. [2019-12-27 02:26:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31689 states. [2019-12-27 02:26:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31689 states to 31689 states and 95359 transitions. [2019-12-27 02:26:53,089 INFO L78 Accepts]: Start accepts. Automaton has 31689 states and 95359 transitions. Word has length 65 [2019-12-27 02:26:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:53,089 INFO L462 AbstractCegarLoop]: Abstraction has 31689 states and 95359 transitions. [2019-12-27 02:26:53,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:26:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31689 states and 95359 transitions. [2019-12-27 02:26:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:26:53,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:53,125 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, 1, 1, 1, 1, 1] [2019-12-27 02:26:53,125 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1108478487, now seen corresponding path program 2 times [2019-12-27 02:26:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037056246] [2019-12-27 02:26:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:53,172 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:26:53,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037056246] [2019-12-27 02:26:53,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:53,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516966359] [2019-12-27 02:26:53,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:53,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:53,174 INFO L87 Difference]: Start difference. First operand 31689 states and 95359 transitions. Second operand 3 states. [2019-12-27 02:26:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:53,288 INFO L93 Difference]: Finished difference Result 24026 states and 71554 transitions. [2019-12-27 02:26:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:53,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:26:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:53,337 INFO L225 Difference]: With dead ends: 24026 [2019-12-27 02:26:53,337 INFO L226 Difference]: Without dead ends: 24026 [2019-12-27 02:26:53,339 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:26:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24026 states. [2019-12-27 02:26:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24026 to 22682. [2019-12-27 02:26:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22682 states. [2019-12-27 02:26:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22682 states to 22682 states and 67444 transitions. [2019-12-27 02:26:53,909 INFO L78 Accepts]: Start accepts. Automaton has 22682 states and 67444 transitions. Word has length 65 [2019-12-27 02:26:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:53,909 INFO L462 AbstractCegarLoop]: Abstraction has 22682 states and 67444 transitions. [2019-12-27 02:26:53,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 22682 states and 67444 transitions. [2019-12-27 02:26:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:26:53,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:53,954 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, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:53,954 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-27 02:26:53,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:53,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244903927] [2019-12-27 02:26:53,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:26:54,028 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:26:54,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244903927] [2019-12-27 02:26:54,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:26:54,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:26:54,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067665636] [2019-12-27 02:26:54,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:26:54,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:26:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:26:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:26:54,030 INFO L87 Difference]: Start difference. First operand 22682 states and 67444 transitions. Second operand 3 states. [2019-12-27 02:26:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:26:54,126 INFO L93 Difference]: Finished difference Result 22682 states and 67443 transitions. [2019-12-27 02:26:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:26:54,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:26:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:26:54,157 INFO L225 Difference]: With dead ends: 22682 [2019-12-27 02:26:54,157 INFO L226 Difference]: Without dead ends: 22682 [2019-12-27 02:26:54,158 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:26:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22682 states. [2019-12-27 02:26:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22682 to 18183. [2019-12-27 02:26:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18183 states. [2019-12-27 02:26:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18183 states to 18183 states and 54770 transitions. [2019-12-27 02:26:54,465 INFO L78 Accepts]: Start accepts. Automaton has 18183 states and 54770 transitions. Word has length 66 [2019-12-27 02:26:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:26:54,465 INFO L462 AbstractCegarLoop]: Abstraction has 18183 states and 54770 transitions. [2019-12-27 02:26:54,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:26:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18183 states and 54770 transitions. [2019-12-27 02:26:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:26:54,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:26:54,485 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:26:54,485 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:26:54,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:26:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 02:26:54,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:26:54,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283949720] [2019-12-27 02:26:54,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:26:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:26:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:26:54,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:26:54,629 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:26:54,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-27 02:26:54,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff0_thd0~0_In894177691 ~a$r_buff1_thd0~0_Out894177691) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In894177691 0)) (= ~a$r_buff0_thd1~0_Out894177691 1) (= ~a$r_buff1_thd3~0_Out894177691 ~a$r_buff0_thd3~0_In894177691) (= 1 ~x~0_Out894177691) (= ~a$r_buff0_thd2~0_In894177691 ~a$r_buff1_thd2~0_Out894177691) (= ~a$r_buff1_thd1~0_Out894177691 ~a$r_buff0_thd1~0_In894177691)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In894177691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In894177691, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In894177691, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In894177691, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In894177691} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out894177691, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out894177691, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out894177691, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out894177691, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In894177691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In894177691, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In894177691, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out894177691, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In894177691, ~x~0=~x~0_Out894177691} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:26:54,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-27 02:26:54,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-27 02:26:54,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out971447835| |P1Thread1of1ForFork2_#t~ite9_Out971447835|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In971447835 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In971447835 256) 0))) (or (and .cse0 (= ~a~0_In971447835 |P1Thread1of1ForFork2_#t~ite9_Out971447835|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= ~a$w_buff1~0_In971447835 |P1Thread1of1ForFork2_#t~ite9_Out971447835|) (not .cse2)))) InVars {~a~0=~a~0_In971447835, ~a$w_buff1~0=~a$w_buff1~0_In971447835, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In971447835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971447835} OutVars{~a~0=~a~0_In971447835, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out971447835|, ~a$w_buff1~0=~a$w_buff1~0_In971447835, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In971447835, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out971447835|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971447835} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 02:26:54,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In493896588 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In493896588 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In493896588 |P1Thread1of1ForFork2_#t~ite11_Out493896588|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out493896588|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out493896588|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:26:54,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-293296695 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-293296695 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-293296695 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-293296695 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-293296695|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-293296695 |P1Thread1of1ForFork2_#t~ite12_Out-293296695|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-293296695, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-293296695, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-293296695} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-293296695, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-293296695, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-293296695|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-293296695} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:26:54,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-700060970 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-700060970| ~a$w_buff0~0_In-700060970) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-700060970| |P2Thread1of1ForFork0_#t~ite20_Out-700060970|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-700060970| ~a$w_buff0~0_In-700060970) (= |P2Thread1of1ForFork0_#t~ite20_Out-700060970| |P2Thread1of1ForFork0_#t~ite21_Out-700060970|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-700060970 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-700060970 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-700060970 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-700060970 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-700060970, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-700060970, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-700060970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-700060970, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-700060970, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-700060970|, ~weak$$choice2~0=~weak$$choice2~0_In-700060970} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-700060970|, ~a$w_buff0~0=~a$w_buff0~0_In-700060970, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-700060970, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-700060970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-700060970, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-700060970|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-700060970, ~weak$$choice2~0=~weak$$choice2~0_In-700060970} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 02:26:54,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1113140487 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1113140487 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1113140487|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1113140487 |P1Thread1of1ForFork2_#t~ite13_Out1113140487|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1113140487|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:26:54,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1742055758 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1742055758 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1742055758 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1742055758 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In1742055758 |P1Thread1of1ForFork2_#t~ite14_Out1742055758|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1742055758|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1742055758, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1742055758, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1742055758|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:26:54,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:26:54,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1323269510 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out1323269510| |P2Thread1of1ForFork0_#t~ite24_Out1323269510|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1323269510 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In1323269510 256)) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In1323269510 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In1323269510 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out1323269510| ~a$w_buff1~0_In1323269510)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1323269510| |P2Thread1of1ForFork0_#t~ite23_Out1323269510|) (= ~a$w_buff1~0_In1323269510 |P2Thread1of1ForFork0_#t~ite24_Out1323269510|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1323269510, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1323269510|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1323269510, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323269510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1323269510, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323269510, ~weak$$choice2~0=~weak$$choice2~0_In1323269510} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1323269510, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1323269510|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1323269510|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1323269510, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323269510, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1323269510, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323269510, ~weak$$choice2~0=~weak$$choice2~0_In1323269510} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 02:26:54,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In359605079 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out359605079| |P2Thread1of1ForFork0_#t~ite26_Out359605079|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out359605079| ~a$w_buff0_used~0_In359605079) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In359605079 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In359605079 256))) (= 0 (mod ~a$w_buff0_used~0_In359605079 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In359605079 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite27_Out359605079| ~a$w_buff0_used~0_In359605079) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In359605079| |P2Thread1of1ForFork0_#t~ite26_Out359605079|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In359605079|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In359605079, ~a$w_buff0_used~0=~a$w_buff0_used~0_In359605079, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In359605079, ~a$w_buff1_used~0=~a$w_buff1_used~0_In359605079, ~weak$$choice2~0=~weak$$choice2~0_In359605079} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out359605079|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out359605079|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In359605079, ~a$w_buff0_used~0=~a$w_buff0_used~0_In359605079, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In359605079, ~a$w_buff1_used~0=~a$w_buff1_used~0_In359605079, ~weak$$choice2~0=~weak$$choice2~0_In359605079} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 02:26:54,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:26:54,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 02:26:54,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In2071676464 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In2071676464 256) 0))) (or (and (= ~a~0_In2071676464 |P2Thread1of1ForFork0_#t~ite38_Out2071676464|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In2071676464 |P2Thread1of1ForFork0_#t~ite38_Out2071676464|)))) InVars {~a~0=~a~0_In2071676464, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2071676464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} OutVars{~a~0=~a~0_In2071676464, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2071676464|, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2071676464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:26:54,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:26:54,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-901255175 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-901255175 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-901255175|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-901255175 |P2Thread1of1ForFork0_#t~ite40_Out-901255175|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901255175} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-901255175|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901255175} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:26:54,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-773194282 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-773194282 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-773194282| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-773194282 |P0Thread1of1ForFork1_#t~ite5_Out-773194282|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-773194282} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-773194282|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-773194282} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:26:54,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1082281405 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1082281405 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1082281405 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1082281405 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1082281405 |P0Thread1of1ForFork1_#t~ite6_Out1082281405|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1082281405|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1082281405|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:26:54,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1050655637 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1050655637 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1050655637 ~a$r_buff0_thd1~0_Out-1050655637)) (and (= 0 ~a$r_buff0_thd1~0_Out-1050655637) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1050655637} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1050655637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1050655637} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:26:54,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-167754557 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-167754557 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-167754557 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-167754557 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-167754557| ~a$r_buff1_thd1~0_In-167754557) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-167754557|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-167754557|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:26:54,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:26:54,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In206596393 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In206596393 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In206596393 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In206596393 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out206596393| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In206596393 |P2Thread1of1ForFork0_#t~ite41_Out206596393|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In206596393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In206596393, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In206596393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In206596393} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In206596393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In206596393, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In206596393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In206596393, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out206596393|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:26:54,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-46152458 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-46152458 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-46152458|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-46152458 |P2Thread1of1ForFork0_#t~ite42_Out-46152458|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46152458} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46152458, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-46152458|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:26:54,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1410789225 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1410789225 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1410789225 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1410789225 256) 0))) (or (and (= ~a$r_buff1_thd3~0_In-1410789225 |P2Thread1of1ForFork0_#t~ite43_Out-1410789225|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1410789225|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1410789225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1410789225, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1410789225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1410789225} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1410789225|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1410789225, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1410789225, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1410789225, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1410789225} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:26:54,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:26:54,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:26:54,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1589963394 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1589963394 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1589963394| |ULTIMATE.start_main_#t~ite48_Out1589963394|))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In1589963394 |ULTIMATE.start_main_#t~ite47_Out1589963394|)) (and (= ~a$w_buff1~0_In1589963394 |ULTIMATE.start_main_#t~ite47_Out1589963394|) (not .cse1) (not .cse0) .cse2))) InVars {~a~0=~a~0_In1589963394, ~a$w_buff1~0=~a$w_buff1~0_In1589963394, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1589963394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394} OutVars{~a~0=~a~0_In1589963394, ~a$w_buff1~0=~a$w_buff1~0_In1589963394, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1589963394|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1589963394, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1589963394|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:26:54,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2110532794 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2110532794 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2110532794| ~a$w_buff0_used~0_In2110532794)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2110532794| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2110532794} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2110532794|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2110532794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:26:54,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1456301977 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1456301977 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1456301977 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1456301977 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1456301977| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out-1456301977| ~a$w_buff1_used~0_In-1456301977) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1456301977, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1456301977} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1456301977|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1456301977, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1456301977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:26:54,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1653495013 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1653495013 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1653495013 |ULTIMATE.start_main_#t~ite51_Out1653495013|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1653495013|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1653495013, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653495013} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1653495013|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653495013, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1653495013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:26:54,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1783052698 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1783052698 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1783052698 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1783052698 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1783052698| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1783052698| ~a$r_buff1_thd0~0_In-1783052698)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1783052698, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1783052698, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1783052698, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1783052698} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1783052698|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1783052698, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1783052698, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1783052698, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1783052698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:26:54,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:26:54,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:26:54 BasicIcfg [2019-12-27 02:26:54,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:26:54,762 INFO L168 Benchmark]: Toolchain (without parser) took 97442.48 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,762 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 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:26:54,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.85 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 102.0 MB in the beginning and 152.2 MB in the end (delta: -50.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,767 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 147.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,767 INFO L168 Benchmark]: RCFGBuilder took 850.72 ms. Allocated memory is still 200.8 MB. Free memory was 147.5 MB in the beginning and 96.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,768 INFO L168 Benchmark]: TraceAbstraction took 95718.99 ms. Allocated memory was 200.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 02:26:54,773 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 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.85 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 102.0 MB in the beginning and 152.2 MB in the end (delta: -50.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.11 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 200.8 MB. Free memory was 149.5 MB in the beginning and 147.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.72 ms. Allocated memory is still 200.8 MB. Free memory was 147.5 MB in the beginning and 96.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95718.99 ms. Allocated memory was 200.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7058 SDtfs, 9981 SDslu, 18807 SDs, 0 SdLazy, 10315 SolverSat, 556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 50 SyntacticMatches, 18 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 496622 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1232 ConstructedInterpolants, 0 QuantifiedInterpolants, 213469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...