/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:24:18,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:24:18,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:24:18,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:24:18,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:24:18,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:24:18,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:24:18,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:24:18,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:24:18,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:24:18,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:24:18,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:24:18,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:24:18,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:24:18,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:24:18,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:24:18,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:24:18,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:24:18,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:24:18,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:24:18,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:24:18,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:24:18,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:24:18,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:24:18,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:24:18,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:24:18,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:24:18,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:24:18,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:24:18,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:24:18,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:24:18,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:24:18,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:24:18,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:24:18,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:24:18,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:24:18,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:24:18,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:24:18,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:24:18,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:24:18,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:24:18,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:24:18,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:24:18,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:24:18,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:24:18,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:24:18,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:24:18,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:24:18,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:24:18,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:24:18,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:24:18,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:24:18,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:24:18,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:24:18,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:24:18,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:24:18,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:24:18,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:24:18,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:24:18,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:24:18,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:24:18,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:24:18,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:24:18,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:18,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:24:18,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:24:18,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:24:18,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:24:18,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:24:18,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:24:18,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:24:18,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:24:18,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:24:18,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:24:18,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:24:18,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:24:18,439 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:24:18,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 13:24:18,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90da0f5a7/31ada24746324e93a66eccf1e45fe853/FLAG1bfdf49d4 [2019-12-18 13:24:19,084 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:24:19,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 13:24:19,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90da0f5a7/31ada24746324e93a66eccf1e45fe853/FLAG1bfdf49d4 [2019-12-18 13:24:19,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90da0f5a7/31ada24746324e93a66eccf1e45fe853 [2019-12-18 13:24:19,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:24:19,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:24:19,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:19,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:24:19,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:24:19,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:19" (1/1) ... [2019-12-18 13:24:19,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:19, skipping insertion in model container [2019-12-18 13:24:19,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:19" (1/1) ... [2019-12-18 13:24:19,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:24:19,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:24:19,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:19,903 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:24:19,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:20,056 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:24:20,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20 WrapperNode [2019-12-18 13:24:20,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:20,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:20,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:24:20,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:24:20,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:20,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:24:20,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:24:20,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:24:20,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... [2019-12-18 13:24:20,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:24:20,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:24:20,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:24:20,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:24:20,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:24:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:24:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:24:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:24:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:24:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:24:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:24:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:24:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:24:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:24:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:24:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:24:20,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:24:20,249 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:24:21,048 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:24:21,048 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:24:21,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:21 BoogieIcfgContainer [2019-12-18 13:24:21,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:24:21,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:24:21,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:24:21,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:24:21,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:24:19" (1/3) ... [2019-12-18 13:24:21,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2041fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:21, skipping insertion in model container [2019-12-18 13:24:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:20" (2/3) ... [2019-12-18 13:24:21,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2041fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:21, skipping insertion in model container [2019-12-18 13:24:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:21" (3/3) ... [2019-12-18 13:24:21,059 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc.i [2019-12-18 13:24:21,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:24:21,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:24:21,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:24:21,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:24:21,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,141 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,141 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,210 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:21,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:24:21,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:24:21,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:24:21,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:24:21,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:24:21,267 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:24:21,267 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:24:21,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:24:21,268 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:24:21,285 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:24:21,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:21,383 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:21,383 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:21,404 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. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:21,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:21,516 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:21,516 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:21,528 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. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:21,552 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:24:21,554 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:24:27,149 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:24:27,265 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:24:27,594 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:24:27,719 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:24:27,747 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:24:27,747 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:24:27,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:24:43,589 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:24:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:24:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:24:43,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:43,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:24:43,598 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-18 13:24:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:24:43,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:43,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476062030] [2019-12-18 13:24:43,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:24:43,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476062030] [2019-12-18 13:24:43,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:43,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:43,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982077040] [2019-12-18 13:24:43,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:43,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:43,840 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:24:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:24:47,017 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:24:47,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:24:47,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:24:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:24:47,626 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:24:47,626 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:24:47,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:24:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:24:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:24:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:24:57,812 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:24:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:24:57,812 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:24:57,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:24:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:24:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:24:57,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:57,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:24:57,817 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-18 13:24:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:24:57,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:57,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156233633] [2019-12-18 13:24:57,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:24:57,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156233633] [2019-12-18 13:24:57,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:57,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:24:57,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567459229] [2019-12-18 13:24:57,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:24:57,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:57,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:24:57,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:24:57,985 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:25:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:02,900 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:25:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:02,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:25:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:03,587 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:25:03,587 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:25:03,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:25:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:25:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:25:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:25:11,291 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:25:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:11,292 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:25:11,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:25:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:25:11,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:11,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:11,298 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-18 13:25:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:25:11,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:11,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776197964] [2019-12-18 13:25:11,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:11,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776197964] [2019-12-18 13:25:11,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:11,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:11,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116479599] [2019-12-18 13:25:11,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:11,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:11,364 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:25:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:11,486 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:25:11,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:11,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:25:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:11,538 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:25:11,539 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:25:11,539 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-18 13:25:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:25:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:25:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:25:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:25:16,318 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:25:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:25:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:25:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:25:16,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:16,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:16,322 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-18 13:25:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:25:16,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:16,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397844476] [2019-12-18 13:25:16,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:16,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397844476] [2019-12-18 13:25:16,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:16,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:16,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94803077] [2019-12-18 13:25:16,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:16,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:16,424 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:25:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:16,823 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:25:16,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:16,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:25:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:16,904 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:25:16,905 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:25:16,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:25:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:25:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:25:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:25:17,984 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:25:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:17,985 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:25:17,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:25:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:25:17,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:17,995 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-18 13:25:17,995 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-18 13:25:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:25:17,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:17,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686809079] [2019-12-18 13:25:17,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:18,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686809079] [2019-12-18 13:25:18,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:18,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:18,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23455220] [2019-12-18 13:25:18,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:18,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:18,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:18,093 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:25:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:18,681 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:25:18,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:18,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:25:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:18,756 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:25:18,756 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:25:18,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:25:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:25:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:25:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:25:20,010 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:25:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:20,010 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:25:20,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:25:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:25:20,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:20,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] [2019-12-18 13:25:20,022 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-18 13:25:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:25:20,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:20,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220906351] [2019-12-18 13:25:20,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220906351] [2019-12-18 13:25:20,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:20,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:20,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462528643] [2019-12-18 13:25:20,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:20,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:20,084 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:25:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:20,147 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:25:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:25:20,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:25:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:20,168 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:25:20,169 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:25:20,169 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-18 13:25:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:25:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:25:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:25:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:25:20,379 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:25:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:20,379 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:25:20,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:25:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:20,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:20,389 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-18 13:25:20,390 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-18 13:25:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:25:20,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:20,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793385187] [2019-12-18 13:25:20,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:20,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793385187] [2019-12-18 13:25:20,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:20,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:20,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659035290] [2019-12-18 13:25:20,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:20,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:20,440 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:25:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:20,544 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:25:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:20,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:20,583 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:25:20,583 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:25:20,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:25:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:25:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:25:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:25:20,862 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:25:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:20,862 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:25:20,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:25:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:20,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:20,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] [2019-12-18 13:25:20,876 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-18 13:25:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:25:20,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:20,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269453935] [2019-12-18 13:25:20,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:20,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269453935] [2019-12-18 13:25:20,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:20,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:20,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978726782] [2019-12-18 13:25:20,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:20,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:20,939 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:25:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:21,027 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:25:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:21,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:21,058 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:25:21,058 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:25:21,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:25:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:25:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:25:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:25:21,338 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:25:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:21,339 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:25:21,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:25:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:21,351 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-18 13:25:21,351 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-18 13:25:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:25:21,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122367381] [2019-12-18 13:25:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:21,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122367381] [2019-12-18 13:25:21,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:21,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:21,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539040212] [2019-12-18 13:25:21,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:21,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:21,482 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:25:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:22,310 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:25:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:22,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:25:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:22,371 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:25:22,371 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:25:22,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:25:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:25:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:25:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:25:22,750 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:25:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:25:22,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:25:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:25:22,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:22,764 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-18 13:25:22,764 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-18 13:25:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:22,764 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:25:22,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:22,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627291951] [2019-12-18 13:25:22,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:22,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627291951] [2019-12-18 13:25:22,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:22,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:22,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565747621] [2019-12-18 13:25:22,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:22,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:22,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:22,906 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:25:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:23,519 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:25:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:23,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:25:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:23,559 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:25:23,559 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:25:23,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:25:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:25:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:25:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:25:23,898 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:25:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:23,899 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:25:23,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:25:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:23,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:23,917 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-18 13:25:23,918 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-18 13:25:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:25:23,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:23,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860735876] [2019-12-18 13:25:23,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:24,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860735876] [2019-12-18 13:25:24,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:24,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:24,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737515660] [2019-12-18 13:25:24,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:24,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:24,072 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:25:24,376 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 13:25:25,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:25,606 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:25:25,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:25,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:25:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:25,663 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:25:25,663 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:25:25,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:25:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:25:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:25:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:25:26,102 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:25:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:26,103 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:25:26,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:25:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:26,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:26,123 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-18 13:25:26,123 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-18 13:25:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:26,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:25:26,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:26,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383673341] [2019-12-18 13:25:26,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:26,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383673341] [2019-12-18 13:25:26,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:26,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:26,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845457196] [2019-12-18 13:25:26,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:26,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:26,256 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:25:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:28,276 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:25:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:28,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:25:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:28,340 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:25:28,341 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:25:28,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:25:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:25:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:25:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:25:29,056 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:25:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:25:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:25:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:29,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:29,074 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-18 13:25:29,074 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-18 13:25:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:25:29,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:29,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801983749] [2019-12-18 13:25:29,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:29,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801983749] [2019-12-18 13:25:29,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:29,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:29,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352365711] [2019-12-18 13:25:29,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:29,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:29,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:29,234 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:25:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:30,690 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:25:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:30,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:25:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:30,769 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:25:30,769 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:25:30,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:25:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:25:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:25:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:25:31,198 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:25:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:25:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:25:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:31,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:31,215 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-18 13:25:31,215 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-18 13:25:31,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:25:31,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:31,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206377972] [2019-12-18 13:25:31,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:31,667 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-12-18 13:25:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:31,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206377972] [2019-12-18 13:25:31,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:31,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:25:31,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683865487] [2019-12-18 13:25:31,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:25:31,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:25:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:25:31,826 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 11 states. [2019-12-18 13:25:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:34,936 INFO L93 Difference]: Finished difference Result 50802 states and 148462 transitions. [2019-12-18 13:25:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:34,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-18 13:25:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:35,016 INFO L225 Difference]: With dead ends: 50802 [2019-12-18 13:25:35,017 INFO L226 Difference]: Without dead ends: 50802 [2019-12-18 13:25:35,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50802 states. [2019-12-18 13:25:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50802 to 18696. [2019-12-18 13:25:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18696 states. [2019-12-18 13:25:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18696 states to 18696 states and 55752 transitions. [2019-12-18 13:25:35,503 INFO L78 Accepts]: Start accepts. Automaton has 18696 states and 55752 transitions. Word has length 34 [2019-12-18 13:25:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:35,503 INFO L462 AbstractCegarLoop]: Abstraction has 18696 states and 55752 transitions. [2019-12-18 13:25:35,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:25:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 18696 states and 55752 transitions. [2019-12-18 13:25:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:35,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:35,519 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-18 13:25:35,519 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-18 13:25:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:25:35,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:35,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327046594] [2019-12-18 13:25:35,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:35,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327046594] [2019-12-18 13:25:35,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:35,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:35,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428780068] [2019-12-18 13:25:35,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:25:35,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:25:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:25:35,737 INFO L87 Difference]: Start difference. First operand 18696 states and 55752 transitions. Second operand 10 states. [2019-12-18 13:25:36,857 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 13:25:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:37,807 INFO L93 Difference]: Finished difference Result 39762 states and 115520 transitions. [2019-12-18 13:25:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:37,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-18 13:25:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:37,866 INFO L225 Difference]: With dead ends: 39762 [2019-12-18 13:25:37,867 INFO L226 Difference]: Without dead ends: 39762 [2019-12-18 13:25:37,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39762 states. [2019-12-18 13:25:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39762 to 18383. [2019-12-18 13:25:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18383 states. [2019-12-18 13:25:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18383 states to 18383 states and 54841 transitions. [2019-12-18 13:25:38,266 INFO L78 Accepts]: Start accepts. Automaton has 18383 states and 54841 transitions. Word has length 34 [2019-12-18 13:25:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:38,266 INFO L462 AbstractCegarLoop]: Abstraction has 18383 states and 54841 transitions. [2019-12-18 13:25:38,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:25:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18383 states and 54841 transitions. [2019-12-18 13:25:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:25:38,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:38,288 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-18 13:25:38,288 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-18 13:25:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:25:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:38,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323416371] [2019-12-18 13:25:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:38,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323416371] [2019-12-18 13:25:38,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:38,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:25:38,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742341083] [2019-12-18 13:25:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:38,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:38,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:38,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:38,339 INFO L87 Difference]: Start difference. First operand 18383 states and 54841 transitions. Second operand 3 states. [2019-12-18 13:25:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:38,410 INFO L93 Difference]: Finished difference Result 18382 states and 54839 transitions. [2019-12-18 13:25:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:38,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:25:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:38,442 INFO L225 Difference]: With dead ends: 18382 [2019-12-18 13:25:38,443 INFO L226 Difference]: Without dead ends: 18382 [2019-12-18 13:25:38,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18382 states. [2019-12-18 13:25:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18382 to 18382. [2019-12-18 13:25:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-18 13:25:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 54839 transitions. [2019-12-18 13:25:38,736 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 54839 transitions. Word has length 39 [2019-12-18 13:25:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 54839 transitions. [2019-12-18 13:25:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 54839 transitions. [2019-12-18 13:25:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:25:38,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:38,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:38,763 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-18 13:25:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:25:38,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:38,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280892641] [2019-12-18 13:25:38,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:38,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280892641] [2019-12-18 13:25:38,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:38,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:38,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85686309] [2019-12-18 13:25:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:38,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:38,811 INFO L87 Difference]: Start difference. First operand 18382 states and 54839 transitions. Second operand 5 states. [2019-12-18 13:25:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:38,911 INFO L93 Difference]: Finished difference Result 17145 states and 52037 transitions. [2019-12-18 13:25:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:38,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:25:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:38,943 INFO L225 Difference]: With dead ends: 17145 [2019-12-18 13:25:38,944 INFO L226 Difference]: Without dead ends: 17145 [2019-12-18 13:25:38,944 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-18 13:25:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2019-12-18 13:25:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 16193. [2019-12-18 13:25:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16193 states. [2019-12-18 13:25:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16193 states to 16193 states and 49447 transitions. [2019-12-18 13:25:39,724 INFO L78 Accepts]: Start accepts. Automaton has 16193 states and 49447 transitions. Word has length 40 [2019-12-18 13:25:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:39,725 INFO L462 AbstractCegarLoop]: Abstraction has 16193 states and 49447 transitions. [2019-12-18 13:25:39,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 16193 states and 49447 transitions. [2019-12-18 13:25:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:39,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:39,747 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-18 13:25:39,747 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-18 13:25:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-18 13:25:39,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150330957] [2019-12-18 13:25:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:39,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150330957] [2019-12-18 13:25:39,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:39,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:39,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128312922] [2019-12-18 13:25:39,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:25:39,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:25:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:39,901 INFO L87 Difference]: Start difference. First operand 16193 states and 49447 transitions. Second operand 9 states. [2019-12-18 13:25:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:41,227 INFO L93 Difference]: Finished difference Result 86676 states and 260202 transitions. [2019-12-18 13:25:41,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:41,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:25:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:41,346 INFO L225 Difference]: With dead ends: 86676 [2019-12-18 13:25:41,346 INFO L226 Difference]: Without dead ends: 78404 [2019-12-18 13:25:41,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:25:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78404 states. [2019-12-18 13:25:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78404 to 17598. [2019-12-18 13:25:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17598 states. [2019-12-18 13:25:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17598 states to 17598 states and 54014 transitions. [2019-12-18 13:25:42,023 INFO L78 Accepts]: Start accepts. Automaton has 17598 states and 54014 transitions. Word has length 64 [2019-12-18 13:25:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:42,024 INFO L462 AbstractCegarLoop]: Abstraction has 17598 states and 54014 transitions. [2019-12-18 13:25:42,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:25:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17598 states and 54014 transitions. [2019-12-18 13:25:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:42,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:42,049 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-18 13:25:42,049 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-18 13:25:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-18 13:25:42,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:42,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557814050] [2019-12-18 13:25:42,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557814050] [2019-12-18 13:25:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607727292] [2019-12-18 13:25:42,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:25:42,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:25:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:42,171 INFO L87 Difference]: Start difference. First operand 17598 states and 54014 transitions. Second operand 9 states. [2019-12-18 13:25:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,192 INFO L93 Difference]: Finished difference Result 99806 states and 298049 transitions. [2019-12-18 13:25:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:25:44,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:25:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:44,290 INFO L225 Difference]: With dead ends: 99806 [2019-12-18 13:25:44,290 INFO L226 Difference]: Without dead ends: 68802 [2019-12-18 13:25:44,290 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-18 13:25:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68802 states. [2019-12-18 13:25:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68802 to 19482. [2019-12-18 13:25:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19482 states. [2019-12-18 13:25:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19482 states to 19482 states and 59883 transitions. [2019-12-18 13:25:44,966 INFO L78 Accepts]: Start accepts. Automaton has 19482 states and 59883 transitions. Word has length 64 [2019-12-18 13:25:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:44,966 INFO L462 AbstractCegarLoop]: Abstraction has 19482 states and 59883 transitions. [2019-12-18 13:25:44,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:25:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 19482 states and 59883 transitions. [2019-12-18 13:25:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:44,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:44,988 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-18 13:25:44,989 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-18 13:25:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-18 13:25:44,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:44,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716032476] [2019-12-18 13:25:44,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:45,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716032476] [2019-12-18 13:25:45,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:45,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:45,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642983045] [2019-12-18 13:25:45,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:45,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:45,067 INFO L87 Difference]: Start difference. First operand 19482 states and 59883 transitions. Second operand 7 states. [2019-12-18 13:25:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:45,752 INFO L93 Difference]: Finished difference Result 45756 states and 139191 transitions. [2019-12-18 13:25:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:25:45,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:25:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:45,827 INFO L225 Difference]: With dead ends: 45756 [2019-12-18 13:25:45,827 INFO L226 Difference]: Without dead ends: 37514 [2019-12-18 13:25:45,827 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-18 13:25:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37514 states. [2019-12-18 13:25:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37514 to 22860. [2019-12-18 13:25:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22860 states. [2019-12-18 13:25:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22860 states to 22860 states and 70603 transitions. [2019-12-18 13:25:46,614 INFO L78 Accepts]: Start accepts. Automaton has 22860 states and 70603 transitions. Word has length 64 [2019-12-18 13:25:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:46,614 INFO L462 AbstractCegarLoop]: Abstraction has 22860 states and 70603 transitions. [2019-12-18 13:25:46,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22860 states and 70603 transitions. [2019-12-18 13:25:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:46,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:46,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:46,645 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-18 13:25:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-18 13:25:46,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:46,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941075676] [2019-12-18 13:25:46,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:46,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941075676] [2019-12-18 13:25:46,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:46,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:46,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109323070] [2019-12-18 13:25:46,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:46,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:46,733 INFO L87 Difference]: Start difference. First operand 22860 states and 70603 transitions. Second operand 7 states. [2019-12-18 13:25:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:47,158 INFO L93 Difference]: Finished difference Result 48262 states and 144953 transitions. [2019-12-18 13:25:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:25:47,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:25:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:47,216 INFO L225 Difference]: With dead ends: 48262 [2019-12-18 13:25:47,216 INFO L226 Difference]: Without dead ends: 41380 [2019-12-18 13:25:47,218 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-18 13:25:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41380 states. [2019-12-18 13:25:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41380 to 23156. [2019-12-18 13:25:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23156 states. [2019-12-18 13:25:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23156 states to 23156 states and 71455 transitions. [2019-12-18 13:25:47,731 INFO L78 Accepts]: Start accepts. Automaton has 23156 states and 71455 transitions. Word has length 64 [2019-12-18 13:25:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:47,731 INFO L462 AbstractCegarLoop]: Abstraction has 23156 states and 71455 transitions. [2019-12-18 13:25:47,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23156 states and 71455 transitions. [2019-12-18 13:25:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:47,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:47,759 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-18 13:25:47,759 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-18 13:25:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-18 13:25:47,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:47,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875630310] [2019-12-18 13:25:47,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875630310] [2019-12-18 13:25:47,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:47,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:47,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636576462] [2019-12-18 13:25:47,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:47,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:47,842 INFO L87 Difference]: Start difference. First operand 23156 states and 71455 transitions. Second operand 3 states. [2019-12-18 13:25:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:47,920 INFO L93 Difference]: Finished difference Result 20860 states and 63031 transitions. [2019-12-18 13:25:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:47,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:25:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:47,948 INFO L225 Difference]: With dead ends: 20860 [2019-12-18 13:25:47,948 INFO L226 Difference]: Without dead ends: 20860 [2019-12-18 13:25:47,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20860 states. [2019-12-18 13:25:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20860 to 19286. [2019-12-18 13:25:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19286 states. [2019-12-18 13:25:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 58189 transitions. [2019-12-18 13:25:48,231 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 58189 transitions. Word has length 64 [2019-12-18 13:25:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:48,231 INFO L462 AbstractCegarLoop]: Abstraction has 19286 states and 58189 transitions. [2019-12-18 13:25:48,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 58189 transitions. [2019-12-18 13:25:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:48,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:48,252 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-18 13:25:48,252 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-18 13:25:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:48,253 INFO L82 PathProgramCache]: Analyzing trace with hash 995250140, now seen corresponding path program 1 times [2019-12-18 13:25:48,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:48,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724061962] [2019-12-18 13:25:48,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724061962] [2019-12-18 13:25:48,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:48,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:48,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022301232] [2019-12-18 13:25:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:48,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:48,330 INFO L87 Difference]: Start difference. First operand 19286 states and 58189 transitions. Second operand 5 states. [2019-12-18 13:25:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:48,886 INFO L93 Difference]: Finished difference Result 21087 states and 63168 transitions. [2019-12-18 13:25:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:25:48,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 13:25:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:48,914 INFO L225 Difference]: With dead ends: 21087 [2019-12-18 13:25:48,914 INFO L226 Difference]: Without dead ends: 21087 [2019-12-18 13:25:48,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21087 states. [2019-12-18 13:25:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21087 to 19568. [2019-12-18 13:25:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19568 states. [2019-12-18 13:25:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19568 states to 19568 states and 59029 transitions. [2019-12-18 13:25:49,203 INFO L78 Accepts]: Start accepts. Automaton has 19568 states and 59029 transitions. Word has length 65 [2019-12-18 13:25:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:49,203 INFO L462 AbstractCegarLoop]: Abstraction has 19568 states and 59029 transitions. [2019-12-18 13:25:49,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19568 states and 59029 transitions. [2019-12-18 13:25:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:49,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:49,224 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-18 13:25:49,224 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-18 13:25:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1346443158, now seen corresponding path program 2 times [2019-12-18 13:25:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:49,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198861196] [2019-12-18 13:25:49,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:49,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198861196] [2019-12-18 13:25:49,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:49,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:49,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70427472] [2019-12-18 13:25:49,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:49,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:49,328 INFO L87 Difference]: Start difference. First operand 19568 states and 59029 transitions. Second operand 6 states. [2019-12-18 13:25:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:49,992 INFO L93 Difference]: Finished difference Result 35357 states and 104371 transitions. [2019-12-18 13:25:49,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:25:49,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:25:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:50,038 INFO L225 Difference]: With dead ends: 35357 [2019-12-18 13:25:50,038 INFO L226 Difference]: Without dead ends: 35137 [2019-12-18 13:25:50,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2019-12-18 13:25:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 26487. [2019-12-18 13:25:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-12-18 13:25:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 79368 transitions. [2019-12-18 13:25:50,520 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 79368 transitions. Word has length 65 [2019-12-18 13:25:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:50,521 INFO L462 AbstractCegarLoop]: Abstraction has 26487 states and 79368 transitions. [2019-12-18 13:25:50,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 79368 transitions. [2019-12-18 13:25:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:50,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:50,550 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-18 13:25:50,550 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-18 13:25:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash 580016848, now seen corresponding path program 3 times [2019-12-18 13:25:50,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:50,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467885422] [2019-12-18 13:25:50,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:50,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467885422] [2019-12-18 13:25:50,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:50,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:50,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872485628] [2019-12-18 13:25:50,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:50,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:50,643 INFO L87 Difference]: Start difference. First operand 26487 states and 79368 transitions. Second operand 6 states. [2019-12-18 13:25:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:51,070 INFO L93 Difference]: Finished difference Result 28610 states and 85121 transitions. [2019-12-18 13:25:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:25:51,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:25:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:51,108 INFO L225 Difference]: With dead ends: 28610 [2019-12-18 13:25:51,108 INFO L226 Difference]: Without dead ends: 28610 [2019-12-18 13:25:51,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28610 states. [2019-12-18 13:25:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28610 to 26836. [2019-12-18 13:25:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26836 states. [2019-12-18 13:25:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26836 states to 26836 states and 80356 transitions. [2019-12-18 13:25:51,829 INFO L78 Accepts]: Start accepts. Automaton has 26836 states and 80356 transitions. Word has length 65 [2019-12-18 13:25:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:51,829 INFO L462 AbstractCegarLoop]: Abstraction has 26836 states and 80356 transitions. [2019-12-18 13:25:51,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26836 states and 80356 transitions. [2019-12-18 13:25:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:51,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:51,864 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-18 13:25:51,864 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-18 13:25:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash -102998324, now seen corresponding path program 4 times [2019-12-18 13:25:51,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:51,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530304951] [2019-12-18 13:25:51,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:51,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530304951] [2019-12-18 13:25:51,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:51,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:25:51,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821558710] [2019-12-18 13:25:51,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:51,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:51,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:51,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:51,951 INFO L87 Difference]: Start difference. First operand 26836 states and 80356 transitions. Second operand 7 states. [2019-12-18 13:25:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:52,863 INFO L93 Difference]: Finished difference Result 36374 states and 107098 transitions. [2019-12-18 13:25:52,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:25:52,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:25:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:52,920 INFO L225 Difference]: With dead ends: 36374 [2019-12-18 13:25:52,920 INFO L226 Difference]: Without dead ends: 36374 [2019-12-18 13:25:52,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:25:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36374 states. [2019-12-18 13:25:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36374 to 26290. [2019-12-18 13:25:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26290 states. [2019-12-18 13:25:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26290 states to 26290 states and 78809 transitions. [2019-12-18 13:25:53,438 INFO L78 Accepts]: Start accepts. Automaton has 26290 states and 78809 transitions. Word has length 65 [2019-12-18 13:25:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:53,438 INFO L462 AbstractCegarLoop]: Abstraction has 26290 states and 78809 transitions. [2019-12-18 13:25:53,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26290 states and 78809 transitions. [2019-12-18 13:25:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:53,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:53,465 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-18 13:25:53,465 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-18 13:25:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 406391726, now seen corresponding path program 5 times [2019-12-18 13:25:53,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:53,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167057904] [2019-12-18 13:25:53,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:53,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167057904] [2019-12-18 13:25:53,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:53,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:25:53,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330362941] [2019-12-18 13:25:53,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:53,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:53,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:53,549 INFO L87 Difference]: Start difference. First operand 26290 states and 78809 transitions. Second operand 7 states. [2019-12-18 13:25:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:54,283 INFO L93 Difference]: Finished difference Result 48037 states and 141632 transitions. [2019-12-18 13:25:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:25:54,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:25:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:54,352 INFO L225 Difference]: With dead ends: 48037 [2019-12-18 13:25:54,353 INFO L226 Difference]: Without dead ends: 48037 [2019-12-18 13:25:54,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:25:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48037 states. [2019-12-18 13:25:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48037 to 26632. [2019-12-18 13:25:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-12-18 13:25:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 79917 transitions. [2019-12-18 13:25:55,216 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 79917 transitions. Word has length 65 [2019-12-18 13:25:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:55,217 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 79917 transitions. [2019-12-18 13:25:55,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 79917 transitions. [2019-12-18 13:25:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:25:55,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:55,259 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-18 13:25:55,259 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-18 13:25:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1972220962, now seen corresponding path program 6 times [2019-12-18 13:25:55,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:55,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109134205] [2019-12-18 13:25:55,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:55,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109134205] [2019-12-18 13:25:55,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:55,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:25:55,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964445360] [2019-12-18 13:25:55,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:25:55,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:25:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:25:55,668 INFO L87 Difference]: Start difference. First operand 26632 states and 79917 transitions. Second operand 14 states. [2019-12-18 13:26:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:04,046 INFO L93 Difference]: Finished difference Result 69478 states and 204079 transitions. [2019-12-18 13:26:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 13:26:04,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-18 13:26:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:04,135 INFO L225 Difference]: With dead ends: 69478 [2019-12-18 13:26:04,135 INFO L226 Difference]: Without dead ends: 69310 [2019-12-18 13:26:04,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=568, Invalid=2624, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 13:26:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69310 states. [2019-12-18 13:26:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69310 to 28380. [2019-12-18 13:26:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28380 states. [2019-12-18 13:26:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28380 states to 28380 states and 84819 transitions. [2019-12-18 13:26:04,877 INFO L78 Accepts]: Start accepts. Automaton has 28380 states and 84819 transitions. Word has length 65 [2019-12-18 13:26:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:04,878 INFO L462 AbstractCegarLoop]: Abstraction has 28380 states and 84819 transitions. [2019-12-18 13:26:04,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:26:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28380 states and 84819 transitions. [2019-12-18 13:26:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:04,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:04,909 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-18 13:26:04,909 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-18 13:26:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1532167548, now seen corresponding path program 7 times [2019-12-18 13:26:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:04,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602390129] [2019-12-18 13:26:04,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:04,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602390129] [2019-12-18 13:26:04,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:04,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:04,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805310633] [2019-12-18 13:26:04,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:04,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:04,968 INFO L87 Difference]: Start difference. First operand 28380 states and 84819 transitions. Second operand 3 states. [2019-12-18 13:26:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:05,177 INFO L93 Difference]: Finished difference Result 33781 states and 101022 transitions. [2019-12-18 13:26:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:05,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:26:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:05,259 INFO L225 Difference]: With dead ends: 33781 [2019-12-18 13:26:05,260 INFO L226 Difference]: Without dead ends: 33781 [2019-12-18 13:26:05,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33781 states. [2019-12-18 13:26:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33781 to 29254. [2019-12-18 13:26:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29254 states. [2019-12-18 13:26:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29254 states to 29254 states and 87821 transitions. [2019-12-18 13:26:05,998 INFO L78 Accepts]: Start accepts. Automaton has 29254 states and 87821 transitions. Word has length 65 [2019-12-18 13:26:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:05,998 INFO L462 AbstractCegarLoop]: Abstraction has 29254 states and 87821 transitions. [2019-12-18 13:26:05,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29254 states and 87821 transitions. [2019-12-18 13:26:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:26:06,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:06,030 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-18 13:26:06,030 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-18 13:26:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-18 13:26:06,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:06,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680027553] [2019-12-18 13:26:06,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:06,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680027553] [2019-12-18 13:26:06,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:06,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:06,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442834470] [2019-12-18 13:26:06,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:06,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:06,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:06,082 INFO L87 Difference]: Start difference. First operand 29254 states and 87821 transitions. Second operand 3 states. [2019-12-18 13:26:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:06,481 INFO L93 Difference]: Finished difference Result 29254 states and 87820 transitions. [2019-12-18 13:26:06,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:06,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:26:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:06,546 INFO L225 Difference]: With dead ends: 29254 [2019-12-18 13:26:06,546 INFO L226 Difference]: Without dead ends: 29254 [2019-12-18 13:26:06,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29254 states. [2019-12-18 13:26:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29254 to 22170. [2019-12-18 13:26:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22170 states. [2019-12-18 13:26:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22170 states to 22170 states and 67293 transitions. [2019-12-18 13:26:07,133 INFO L78 Accepts]: Start accepts. Automaton has 22170 states and 67293 transitions. Word has length 66 [2019-12-18 13:26:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:07,133 INFO L462 AbstractCegarLoop]: Abstraction has 22170 states and 67293 transitions. [2019-12-18 13:26:07,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 22170 states and 67293 transitions. [2019-12-18 13:26:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:07,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:07,155 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-18 13:26:07,155 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-18 13:26:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -586454608, now seen corresponding path program 1 times [2019-12-18 13:26:07,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:07,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620194174] [2019-12-18 13:26:07,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:07,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620194174] [2019-12-18 13:26:07,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:07,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:26:07,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195599204] [2019-12-18 13:26:07,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:07,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:07,213 INFO L87 Difference]: Start difference. First operand 22170 states and 67293 transitions. Second operand 3 states. [2019-12-18 13:26:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:07,499 INFO L93 Difference]: Finished difference Result 29360 states and 89132 transitions. [2019-12-18 13:26:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:07,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:26:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:07,567 INFO L225 Difference]: With dead ends: 29360 [2019-12-18 13:26:07,567 INFO L226 Difference]: Without dead ends: 29360 [2019-12-18 13:26:07,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29360 states. [2019-12-18 13:26:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29360 to 22610. [2019-12-18 13:26:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22610 states. [2019-12-18 13:26:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22610 states to 22610 states and 68739 transitions. [2019-12-18 13:26:08,060 INFO L78 Accepts]: Start accepts. Automaton has 22610 states and 68739 transitions. Word has length 67 [2019-12-18 13:26:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:08,060 INFO L462 AbstractCegarLoop]: Abstraction has 22610 states and 68739 transitions. [2019-12-18 13:26:08,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 22610 states and 68739 transitions. [2019-12-18 13:26:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:08,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:08,084 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-18 13:26:08,084 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1786041058, now seen corresponding path program 1 times [2019-12-18 13:26:08,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:08,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106389739] [2019-12-18 13:26:08,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106389739] [2019-12-18 13:26:08,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:08,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:08,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914759269] [2019-12-18 13:26:08,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:08,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:08,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:08,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:08,210 INFO L87 Difference]: Start difference. First operand 22610 states and 68739 transitions. Second operand 9 states. [2019-12-18 13:26:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:09,508 INFO L93 Difference]: Finished difference Result 73603 states and 217967 transitions. [2019-12-18 13:26:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:09,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 13:26:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:09,607 INFO L225 Difference]: With dead ends: 73603 [2019-12-18 13:26:09,607 INFO L226 Difference]: Without dead ends: 65792 [2019-12-18 13:26:09,608 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-18 13:26:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65792 states. [2019-12-18 13:26:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65792 to 23327. [2019-12-18 13:26:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23327 states. [2019-12-18 13:26:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23327 states to 23327 states and 70694 transitions. [2019-12-18 13:26:10,564 INFO L78 Accepts]: Start accepts. Automaton has 23327 states and 70694 transitions. Word has length 67 [2019-12-18 13:26:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:10,564 INFO L462 AbstractCegarLoop]: Abstraction has 23327 states and 70694 transitions. [2019-12-18 13:26:10,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23327 states and 70694 transitions. [2019-12-18 13:26:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:10,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:10,586 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-18 13:26:10,587 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1769776424, now seen corresponding path program 2 times [2019-12-18 13:26:10,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:10,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179531607] [2019-12-18 13:26:10,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:10,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179531607] [2019-12-18 13:26:10,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:10,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:10,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217100841] [2019-12-18 13:26:10,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:10,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:10,694 INFO L87 Difference]: Start difference. First operand 23327 states and 70694 transitions. Second operand 9 states. [2019-12-18 13:26:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:11,771 INFO L93 Difference]: Finished difference Result 61498 states and 182284 transitions. [2019-12-18 13:26:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:26:11,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 13:26:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:11,850 INFO L225 Difference]: With dead ends: 61498 [2019-12-18 13:26:11,850 INFO L226 Difference]: Without dead ends: 58802 [2019-12-18 13:26:11,850 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-18 13:26:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58802 states. [2019-12-18 13:26:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58802 to 21982. [2019-12-18 13:26:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21982 states. [2019-12-18 13:26:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21982 states to 21982 states and 66552 transitions. [2019-12-18 13:26:12,424 INFO L78 Accepts]: Start accepts. Automaton has 21982 states and 66552 transitions. Word has length 67 [2019-12-18 13:26:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:12,424 INFO L462 AbstractCegarLoop]: Abstraction has 21982 states and 66552 transitions. [2019-12-18 13:26:12,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21982 states and 66552 transitions. [2019-12-18 13:26:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:12,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:12,450 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-18 13:26:12,450 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 176666880, now seen corresponding path program 3 times [2019-12-18 13:26:12,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:12,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625011297] [2019-12-18 13:26:12,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:12,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625011297] [2019-12-18 13:26:12,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:12,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:26:12,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740431351] [2019-12-18 13:26:12,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:26:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:26:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:26:12,671 INFO L87 Difference]: Start difference. First operand 21982 states and 66552 transitions. Second operand 10 states. [2019-12-18 13:26:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:14,829 INFO L93 Difference]: Finished difference Result 48237 states and 145776 transitions. [2019-12-18 13:26:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:26:14,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:26:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:14,894 INFO L225 Difference]: With dead ends: 48237 [2019-12-18 13:26:14,895 INFO L226 Difference]: Without dead ends: 48237 [2019-12-18 13:26:14,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=727, Unknown=0, NotChecked=0, Total=992 [2019-12-18 13:26:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-18 13:26:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 24561. [2019-12-18 13:26:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24561 states. [2019-12-18 13:26:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24561 states to 24561 states and 74992 transitions. [2019-12-18 13:26:15,430 INFO L78 Accepts]: Start accepts. Automaton has 24561 states and 74992 transitions. Word has length 67 [2019-12-18 13:26:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:15,430 INFO L462 AbstractCegarLoop]: Abstraction has 24561 states and 74992 transitions. [2019-12-18 13:26:15,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:26:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24561 states and 74992 transitions. [2019-12-18 13:26:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:15,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:15,456 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-18 13:26:15,456 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1904730590, now seen corresponding path program 2 times [2019-12-18 13:26:15,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:15,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931467327] [2019-12-18 13:26:15,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:15,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931467327] [2019-12-18 13:26:15,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:15,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:26:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282370379] [2019-12-18 13:26:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:26:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:26:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:26:15,582 INFO L87 Difference]: Start difference. First operand 24561 states and 74992 transitions. Second operand 6 states. [2019-12-18 13:26:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:15,708 INFO L93 Difference]: Finished difference Result 24137 states and 73450 transitions. [2019-12-18 13:26:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:15,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 13:26:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:15,740 INFO L225 Difference]: With dead ends: 24137 [2019-12-18 13:26:15,740 INFO L226 Difference]: Without dead ends: 24137 [2019-12-18 13:26:15,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24137 states. [2019-12-18 13:26:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24137 to 19147. [2019-12-18 13:26:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19147 states. [2019-12-18 13:26:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19147 states to 19147 states and 57616 transitions. [2019-12-18 13:26:16,061 INFO L78 Accepts]: Start accepts. Automaton has 19147 states and 57616 transitions. Word has length 67 [2019-12-18 13:26:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:16,061 INFO L462 AbstractCegarLoop]: Abstraction has 19147 states and 57616 transitions. [2019-12-18 13:26:16,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:26:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 19147 states and 57616 transitions. [2019-12-18 13:26:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:16,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:16,080 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-18 13:26:16,081 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:26:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:16,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607949785] [2019-12-18 13:26:16,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:16,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:26:16,194 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:26:16,198 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) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51|)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51|) |v_ULTIMATE.start_main_~#t1001~0.offset_32| 0))) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1001~0.base_51|) (= 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_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51| 1)) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1001~0.base_51| 4)) (< 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_ULTIMATE.start_main_~#t1001~0.offset_32|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= 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) (= 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{~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_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_39|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_20|, ~a~0=v_~a~0_163, 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, ~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|, ~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, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_28|, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_~#t1001~0.base=|v_ULTIMATE.start_main_~#t1001~0.base_51|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_19|, ~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|, ULTIMATE.start_main_~#t1001~0.offset=|v_ULTIMATE.start_main_~#t1001~0.offset_32|, ~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} AuxVars[] AssignedVars[~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_~#t1002~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1003~0.offset, ~a~0, 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, ~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, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1003~0.base, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1001~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1002~0.offset, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1001~0.offset, ~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] because there is no mapped edge [2019-12-18 13:26:16,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff0_thd2~0_In-832257874 ~a$r_buff1_thd2~0_Out-832257874) (= ~a$r_buff1_thd0~0_Out-832257874 ~a$r_buff0_thd0~0_In-832257874) (= ~a$r_buff1_thd3~0_Out-832257874 ~a$r_buff0_thd3~0_In-832257874) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-832257874)) (= ~a$r_buff0_thd1~0_In-832257874 ~a$r_buff1_thd1~0_Out-832257874) (= ~a$r_buff0_thd1~0_Out-832257874 1) (= ~x~0_Out-832257874 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-832257874, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-832257874, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-832257874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-832257874, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-832257874} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-832257874, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-832257874, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-832257874, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-832257874, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-832257874, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-832257874, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-832257874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-832257874, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-832257874, ~x~0=~x~0_Out-832257874} 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-18 13:26:16,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1002~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1002~0.base_9| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1002~0.base_9|) (= |v_ULTIMATE.start_main_~#t1002~0.offset_7| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9|) |v_ULTIMATE.start_main_~#t1002~0.offset_7| 1)) |v_#memory_int_11|)) 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_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1002~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1002~0.base] because there is no mapped edge [2019-12-18 13:26:16,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9| 1) |v_#valid_32|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1003~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) |v_ULTIMATE.start_main_~#t1003~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1003~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1003~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~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_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_8|, #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_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1003~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1003~0.base, #length] because there is no mapped edge [2019-12-18 13:26:16,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In289964276 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In289964276 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out289964276| |P1Thread1of1ForFork2_#t~ite10_Out289964276|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out289964276| ~a~0_In289964276) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out289964276| ~a$w_buff1~0_In289964276) (not .cse1) .cse0))) InVars {~a~0=~a~0_In289964276, ~a$w_buff1~0=~a$w_buff1~0_In289964276, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In289964276, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289964276} OutVars{~a~0=~a~0_In289964276, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out289964276|, ~a$w_buff1~0=~a$w_buff1~0_In289964276, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In289964276, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out289964276|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289964276} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:26:16,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1800938152 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1800938152 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1800938152| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1800938152| ~a$w_buff0_used~0_In-1800938152) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1800938152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1800938152} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1800938152, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1800938152, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1800938152|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:26:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1141200539 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1141200539 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1141200539 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1141200539 256) 0))) (or (and (= ~a$w_buff1_used~0_In1141200539 |P1Thread1of1ForFork2_#t~ite12_Out1141200539|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1141200539| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1141200539, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1141200539, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141200539, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1141200539} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1141200539, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1141200539, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141200539, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1141200539|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1141200539} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:26:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1733547779 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1733547779| ~a$w_buff0~0_In-1733547779) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1733547779 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1733547779 256) 0)) (and (= (mod ~a$r_buff1_thd3~0_In-1733547779 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1733547779 256)))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1733547779| |P2Thread1of1ForFork0_#t~ite20_Out-1733547779|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-1733547779| |P2Thread1of1ForFork0_#t~ite20_Out-1733547779|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1733547779| ~a$w_buff0~0_In-1733547779)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1733547779, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1733547779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733547779, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1733547779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1733547779, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1733547779|, ~weak$$choice2~0=~weak$$choice2~0_In-1733547779} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1733547779|, ~a$w_buff0~0=~a$w_buff0~0_In-1733547779, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1733547779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733547779, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1733547779, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1733547779|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1733547779, ~weak$$choice2~0=~weak$$choice2~0_In-1733547779} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:26:16,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-175092058 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-175092058 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-175092058|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-175092058 |P1Thread1of1ForFork2_#t~ite13_Out-175092058|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-175092058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-175092058} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-175092058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-175092058, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-175092058|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:26:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In896460868 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In896460868 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In896460868 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In896460868 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out896460868| ~a$r_buff1_thd2~0_In896460868) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out896460868| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In896460868, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In896460868, ~a$w_buff0_used~0=~a$w_buff0_used~0_In896460868, ~a$w_buff1_used~0=~a$w_buff1_used~0_In896460868} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In896460868, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In896460868, ~a$w_buff0_used~0=~a$w_buff0_used~0_In896460868, ~a$w_buff1_used~0=~a$w_buff1_used~0_In896460868, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out896460868|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:26:16,207 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-18 13:26:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1538592735 256)))) (or (and (= ~a$w_buff1~0_In-1538592735 |P2Thread1of1ForFork0_#t~ite24_Out-1538592735|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-1538592735| |P2Thread1of1ForFork0_#t~ite23_Out-1538592735|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1538592735| |P2Thread1of1ForFork0_#t~ite23_Out-1538592735|) (= ~a$w_buff1~0_In-1538592735 |P2Thread1of1ForFork0_#t~ite23_Out-1538592735|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1538592735 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1538592735 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1538592735 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1538592735 256) 0))))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1538592735, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1538592735|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1538592735, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1538592735, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1538592735, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1538592735, ~weak$$choice2~0=~weak$$choice2~0_In-1538592735} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1538592735, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1538592735|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1538592735|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1538592735, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1538592735, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1538592735, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1538592735, ~weak$$choice2~0=~weak$$choice2~0_In-1538592735} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:26:16,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In780228628 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out780228628| ~a$w_buff0_used~0_In780228628) (= |P2Thread1of1ForFork0_#t~ite27_Out780228628| |P2Thread1of1ForFork0_#t~ite26_Out780228628|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In780228628 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In780228628 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In780228628 256))) (= (mod ~a$w_buff0_used~0_In780228628 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out780228628| ~a$w_buff0_used~0_In780228628) (= |P2Thread1of1ForFork0_#t~ite26_In780228628| |P2Thread1of1ForFork0_#t~ite26_Out780228628|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In780228628|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In780228628, ~a$w_buff0_used~0=~a$w_buff0_used~0_In780228628, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In780228628, ~a$w_buff1_used~0=~a$w_buff1_used~0_In780228628, ~weak$$choice2~0=~weak$$choice2~0_In780228628} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out780228628|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out780228628|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In780228628, ~a$w_buff0_used~0=~a$w_buff0_used~0_In780228628, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In780228628, ~a$w_buff1_used~0=~a$w_buff1_used~0_In780228628, ~weak$$choice2~0=~weak$$choice2~0_In780228628} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:26:16,211 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-18 13:26:16,212 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-18 13:26:16,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1745783145 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1745783145 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-1745783145 |P2Thread1of1ForFork0_#t~ite38_Out-1745783145|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1745783145| ~a$w_buff1~0_In-1745783145) (not .cse0)))) InVars {~a~0=~a~0_In-1745783145, ~a$w_buff1~0=~a$w_buff1~0_In-1745783145, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1745783145, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745783145} OutVars{~a~0=~a~0_In-1745783145, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1745783145|, ~a$w_buff1~0=~a$w_buff1~0_In-1745783145, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1745783145, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745783145} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:26:16,213 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-18 13:26:16,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-267354685 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-267354685 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-267354685| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-267354685| ~a$w_buff0_used~0_In-267354685) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-267354685} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-267354685|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-267354685} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:26:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-811913224 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-811913224 256) 0))) (or (and (= ~a$w_buff0_used~0_In-811913224 |P0Thread1of1ForFork1_#t~ite5_Out-811913224|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-811913224| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-811913224, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-811913224} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-811913224|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-811913224, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-811913224} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:26:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In52156376 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In52156376 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In52156376 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In52156376 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out52156376| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out52156376| ~a$w_buff1_used~0_In52156376) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In52156376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In52156376, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In52156376, ~a$w_buff1_used~0=~a$w_buff1_used~0_In52156376} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out52156376|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In52156376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In52156376, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In52156376, ~a$w_buff1_used~0=~a$w_buff1_used~0_In52156376} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:26:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1575635864 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1575635864 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1575635864 ~a$r_buff0_thd1~0_Out-1575635864)) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1575635864) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1575635864} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1575635864|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1575635864} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:26:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1493060747 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1493060747 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1493060747 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1493060747 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1493060747| ~a$r_buff1_thd1~0_In1493060747) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1493060747| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1493060747, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493060747} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1493060747|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1493060747, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1493060747} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:26:16,215 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-18 13:26:16,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In1274758487 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1274758487 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1274758487 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1274758487 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1274758487| ~a$w_buff1_used~0_In1274758487)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1274758487| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1274758487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1274758487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1274758487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1274758487} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1274758487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1274758487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1274758487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1274758487, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1274758487|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:26:16,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1780703445 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1780703445 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1780703445| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1780703445| ~a$r_buff0_thd3~0_In1780703445)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1780703445} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1780703445, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1780703445|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:26:16,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1281817743 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1281817743 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1281817743 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1281817743 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1281817743|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-1281817743 |P2Thread1of1ForFork0_#t~ite43_Out-1281817743|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1281817743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1281817743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1281817743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1281817743} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1281817743|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1281817743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1281817743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1281817743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1281817743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:26:16,218 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-18 13:26:16,218 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-18 13:26:16,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1481101824 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1481101824 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1481101824| |ULTIMATE.start_main_#t~ite47_Out-1481101824|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1481101824| ~a$w_buff1~0_In-1481101824) .cse2) (and (or .cse0 .cse1) (= ~a~0_In-1481101824 |ULTIMATE.start_main_#t~ite47_Out-1481101824|) .cse2))) InVars {~a~0=~a~0_In-1481101824, ~a$w_buff1~0=~a$w_buff1~0_In-1481101824, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1481101824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481101824} OutVars{~a~0=~a~0_In-1481101824, ~a$w_buff1~0=~a$w_buff1~0_In-1481101824, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1481101824|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1481101824, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1481101824|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481101824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:26:16,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In854374781 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In854374781 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out854374781| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out854374781| ~a$w_buff0_used~0_In854374781) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In854374781} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out854374781|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In854374781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:26:16,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-441524574 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-441524574 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-441524574 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-441524574 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-441524574 |ULTIMATE.start_main_#t~ite50_Out-441524574|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-441524574| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-441524574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441524574, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-441524574, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441524574} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-441524574|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-441524574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-441524574, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-441524574, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-441524574} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:26:16,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-731114007 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-731114007 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-731114007| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-731114007| ~a$r_buff0_thd0~0_In-731114007) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-731114007, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-731114007} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-731114007|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-731114007, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-731114007} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:26:16,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-600891876 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-600891876 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-600891876 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-600891876 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-600891876| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-600891876| ~a$r_buff1_thd0~0_In-600891876) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-600891876|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:26:16,222 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-18 13:26:16,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:26:16 BasicIcfg [2019-12-18 13:26:16,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:26:16,310 INFO L168 Benchmark]: Toolchain (without parser) took 116966.62 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -959.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,310 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.61 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.1 MB in the beginning and 155.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,311 INFO L168 Benchmark]: Boogie Preprocessor took 43.68 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,312 INFO L168 Benchmark]: RCFGBuilder took 879.43 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 99.9 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,312 INFO L168 Benchmark]: TraceAbstraction took 115255.74 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -958.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:16,314 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.61 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.1 MB in the beginning and 155.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.68 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.43 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 99.9 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115255.74 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -958.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 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: 2.0s, 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(&t1001, ((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(&t1002, ((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(&t1003, ((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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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=8, 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: 114.9s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 46.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8833 SDtfs, 12950 SDslu, 27914 SDs, 0 SdLazy, 19211 SolverSat, 774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 71 SyntacticMatches, 31 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 8.4s 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: 40.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 531772 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1689 NumberOfCodeBlocks, 1689 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1587 ConstructedInterpolants, 0 QuantifiedInterpolants, 383396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...