/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:07,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:07,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:07,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:07,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:07,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:07,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:07,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:07,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:07,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:07,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:07,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:07,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:07,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:07,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:07,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:07,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:07,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:07,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:07,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:07,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:07,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:07,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:07,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:07,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:07,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:07,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:07,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:07,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:07,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:07,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:07,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:07,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:07,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:07,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:07,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:07,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:07,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:07,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:07,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:07,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:07,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:45:07,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:07,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:07,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:07,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:07,151 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:07,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:07,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:07,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:07,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:07,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:07,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:07,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:07,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:07,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:07,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:07,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:07,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:07,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:07,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:07,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:07,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:07,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:07,156 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:07,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:07,156 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:07,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:07,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:07,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:07,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:07,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:07,454 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:07,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-27 16:45:07,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb0c63/f80c8c98185d4ea5a6747b76b37e84de/FLAG0b54fd5bb [2019-12-27 16:45:08,078 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:08,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-27 16:45:08,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb0c63/f80c8c98185d4ea5a6747b76b37e84de/FLAG0b54fd5bb [2019-12-27 16:45:08,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428bb0c63/f80c8c98185d4ea5a6747b76b37e84de [2019-12-27 16:45:08,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:08,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:08,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:08,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:08,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:08,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:08" (1/1) ... [2019-12-27 16:45:08,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327fbd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:08, skipping insertion in model container [2019-12-27 16:45:08,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:08" (1/1) ... [2019-12-27 16:45:08,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:08,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:09,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:09,014 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:45:09,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:09,172 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:45:09,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09 WrapperNode [2019-12-27 16:45:09,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:09,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:09,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:45:09,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:45:09,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:09,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:45:09,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:45:09,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:45:09,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:45:09,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:45:09,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:45:09,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:45:09,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:45:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:45:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:45:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:45:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:45:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:45:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:45:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:45:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:45:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:45:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:45:09,367 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:45:10,086 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:45:10,086 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:45:10,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:10 BoogieIcfgContainer [2019-12-27 16:45:10,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:45:10,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:45:10,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:45:10,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:45:10,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:08" (1/3) ... [2019-12-27 16:45:10,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9db59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:10, skipping insertion in model container [2019-12-27 16:45:10,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (2/3) ... [2019-12-27 16:45:10,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9db59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:10, skipping insertion in model container [2019-12-27 16:45:10,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:10" (3/3) ... [2019-12-27 16:45:10,097 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-12-27 16:45:10,108 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:45:10,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:45:10,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:45:10,124 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:45:10,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:45:10,300 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:45:10,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:45:10,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:45:10,300 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:45:10,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:45:10,301 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:45:10,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:45:10,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:45:10,324 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 16:45:10,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 16:45:10,440 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 16:45:10,441 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:10,457 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:45:10,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 16:45:10,564 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 16:45:10,564 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:10,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:45:10,592 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:45:10,593 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:15,608 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-27 16:45:15,913 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:45:16,032 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:45:16,050 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-27 16:45:16,050 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-27 16:45:16,054 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 16:45:16,467 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 16:45:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 16:45:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:45:16,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:16,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:45:16,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-27 16:45:16,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228419390] [2019-12-27 16:45:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:16,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228419390] [2019-12-27 16:45:16,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:16,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:45:16,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111916080] [2019-12-27 16:45:16,802 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:16,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:16,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:45:16,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:16,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:16,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:16,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:16,891 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 16:45:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:17,155 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-27 16:45:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:17,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:45:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:17,275 INFO L225 Difference]: With dead ends: 8472 [2019-12-27 16:45:17,275 INFO L226 Difference]: Without dead ends: 7980 [2019-12-27 16:45:17,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-27 16:45:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-27 16:45:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-27 16:45:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-27 16:45:17,690 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-27 16:45:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:17,691 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-27 16:45:17,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-27 16:45:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:45:17,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:17,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:17,695 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-27 16:45:17,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:17,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334844988] [2019-12-27 16:45:17,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:17,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334844988] [2019-12-27 16:45:17,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:17,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:17,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670302195] [2019-12-27 16:45:17,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:17,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:17,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:45:17,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:17,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:17,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:17,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:17,788 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-27 16:45:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:17,819 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-27 16:45:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:17,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:45:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:17,827 INFO L225 Difference]: With dead ends: 1284 [2019-12-27 16:45:17,827 INFO L226 Difference]: Without dead ends: 1284 [2019-12-27 16:45:17,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-27 16:45:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-27 16:45:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-27 16:45:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-27 16:45:17,863 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-27 16:45:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:17,864 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-27 16:45:17,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-27 16:45:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:17,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:17,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:17,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-27 16:45:17,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:17,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24924905] [2019-12-27 16:45:17,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:17,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24924905] [2019-12-27 16:45:17,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:17,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:17,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452105449] [2019-12-27 16:45:17,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:17,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:17,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:45:17,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:17,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:17,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:17,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:17,990 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-27 16:45:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:18,075 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-27 16:45:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:18,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:45:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:18,087 INFO L225 Difference]: With dead ends: 1993 [2019-12-27 16:45:18,087 INFO L226 Difference]: Without dead ends: 1993 [2019-12-27 16:45:18,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-27 16:45:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-27 16:45:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-27 16:45:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-27 16:45:18,180 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-27 16:45:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:18,181 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-27 16:45:18,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-27 16:45:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:18,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:18,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:18,183 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-27 16:45:18,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:18,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12779681] [2019-12-27 16:45:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:18,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12779681] [2019-12-27 16:45:18,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:18,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:18,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486050475] [2019-12-27 16:45:18,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:18,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:18,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:45:18,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:18,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:45:18,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:45:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:45:18,262 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-27 16:45:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:18,448 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-27 16:45:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:18,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:45:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:18,458 INFO L225 Difference]: With dead ends: 1803 [2019-12-27 16:45:18,458 INFO L226 Difference]: Without dead ends: 1803 [2019-12-27 16:45:18,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-27 16:45:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-27 16:45:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-27 16:45:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-27 16:45:18,506 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-27 16:45:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:18,506 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-27 16:45:18,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:45:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-27 16:45:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:18,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:18,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:18,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-27 16:45:18,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:18,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281140602] [2019-12-27 16:45:18,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:18,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281140602] [2019-12-27 16:45:18,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:18,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:18,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661846171] [2019-12-27 16:45:18,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:18,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:18,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:45:18,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:18,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:45:18,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:45:18,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:45:18,560 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-27 16:45:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:18,739 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-27 16:45:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:18,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:45:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:18,750 INFO L225 Difference]: With dead ends: 2116 [2019-12-27 16:45:18,751 INFO L226 Difference]: Without dead ends: 2116 [2019-12-27 16:45:18,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-27 16:45:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-27 16:45:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-27 16:45:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-27 16:45:18,797 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-27 16:45:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:18,797 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-27 16:45:18,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:45:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-27 16:45:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:45:18,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:18,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:18,801 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-27 16:45:18,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:18,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312740329] [2019-12-27 16:45:18,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:18,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312740329] [2019-12-27 16:45:18,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:18,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:18,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535294112] [2019-12-27 16:45:18,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:18,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:18,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:45:18,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:18,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:18,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,917 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-27 16:45:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,166 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-27 16:45:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:19,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:45:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,179 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 16:45:19,179 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 16:45:19,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 16:45:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-27 16:45:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 16:45:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-27 16:45:19,229 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-27 16:45:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,230 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-27 16:45:19,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-27 16:45:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:45:19,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:19,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-27 16:45:19,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107045199] [2019-12-27 16:45:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:19,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107045199] [2019-12-27 16:45:19,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:45:19,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541362262] [2019-12-27 16:45:19,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:45:19,300 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:19,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:19,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:19,303 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-27 16:45:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,330 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-27 16:45:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:19,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:45:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,338 INFO L225 Difference]: With dead ends: 2126 [2019-12-27 16:45:19,338 INFO L226 Difference]: Without dead ends: 2126 [2019-12-27 16:45:19,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-27 16:45:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-27 16:45:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-27 16:45:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-27 16:45:19,409 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-27 16:45:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,410 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-27 16:45:19,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-27 16:45:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:45:19,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:19,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-27 16:45:19,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735848890] [2019-12-27 16:45:19,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:19,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735848890] [2019-12-27 16:45:19,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:19,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964882910] [2019-12-27 16:45:19,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:45:19,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:19,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:19,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:19,572 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-27 16:45:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,815 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-27 16:45:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:19,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:45:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,824 INFO L225 Difference]: With dead ends: 2503 [2019-12-27 16:45:19,824 INFO L226 Difference]: Without dead ends: 2503 [2019-12-27 16:45:19,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-27 16:45:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-27 16:45:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-27 16:45:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-27 16:45:19,873 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-27 16:45:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,874 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-27 16:45:19,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-27 16:45:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:45:19,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:19,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-27 16:45:19,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858636400] [2019-12-27 16:45:19,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858636400] [2019-12-27 16:45:19,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:19,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222223032] [2019-12-27 16:45:19,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 16:45:19,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:19,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:19,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:19,963 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 5 states. [2019-12-27 16:45:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,024 INFO L93 Difference]: Finished difference Result 3151 states and 7355 transitions. [2019-12-27 16:45:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:20,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:45:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,029 INFO L225 Difference]: With dead ends: 3151 [2019-12-27 16:45:20,029 INFO L226 Difference]: Without dead ends: 1451 [2019-12-27 16:45:20,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-12-27 16:45:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1433. [2019-12-27 16:45:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-27 16:45:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-27 16:45:20,061 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-27 16:45:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,061 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-27 16:45:20,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-27 16:45:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:45:20,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:20,067 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-27 16:45:20,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894039296] [2019-12-27 16:45:20,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:20,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894039296] [2019-12-27 16:45:20,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:20,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:45:20,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353428298] [2019-12-27 16:45:20,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:20,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:20,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 41 transitions. [2019-12-27 16:45:20,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:20,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:45:20,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:45:20,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:45:20,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:20,244 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 6 states. [2019-12-27 16:45:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,759 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-27 16:45:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:45:20,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:45:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,766 INFO L225 Difference]: With dead ends: 2262 [2019-12-27 16:45:20,766 INFO L226 Difference]: Without dead ends: 2262 [2019-12-27 16:45:20,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-27 16:45:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-27 16:45:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-27 16:45:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-27 16:45:20,809 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-27 16:45:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,810 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-27 16:45:20,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:45:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-27 16:45:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:45:20,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:20,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-27 16:45:20,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786139857] [2019-12-27 16:45:20,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:20,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786139857] [2019-12-27 16:45:20,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:20,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:20,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603105811] [2019-12-27 16:45:20,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:20,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:20,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 42 transitions. [2019-12-27 16:45:20,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:20,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:20,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:45:20,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:20,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:45:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:45:20,891 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-27 16:45:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,912 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-27 16:45:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:45:20,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 16:45:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,914 INFO L225 Difference]: With dead ends: 1113 [2019-12-27 16:45:20,914 INFO L226 Difference]: Without dead ends: 1002 [2019-12-27 16:45:20,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:45:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-27 16:45:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-27 16:45:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 16:45:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-27 16:45:20,975 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-27 16:45:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,975 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-27 16:45:20,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:45:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-27 16:45:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:45:20,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,978 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] [2019-12-27 16:45:20,978 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-27 16:45:20,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278117804] [2019-12-27 16:45:20,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:21,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278117804] [2019-12-27 16:45:21,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:21,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:21,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157441481] [2019-12-27 16:45:21,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:21,088 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:21,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 137 transitions. [2019-12-27 16:45:21,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:21,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:21,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:45:21,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:45:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:21,146 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-27 16:45:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:21,439 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-27 16:45:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:45:21,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 16:45:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:21,444 INFO L225 Difference]: With dead ends: 2777 [2019-12-27 16:45:21,445 INFO L226 Difference]: Without dead ends: 1853 [2019-12-27 16:45:21,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:45:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-27 16:45:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-27 16:45:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-27 16:45:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-27 16:45:21,472 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-27 16:45:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:21,473 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-27 16:45:21,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:45:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-27 16:45:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:45:21,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:21,476 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] [2019-12-27 16:45:21,476 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-27 16:45:21,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531240799] [2019-12-27 16:45:21,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:21,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531240799] [2019-12-27 16:45:21,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:21,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:45:21,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440504027] [2019-12-27 16:45:21,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:21,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:21,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-27 16:45:21,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:21,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:45:21,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:21,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:21,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:21,670 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 5 states. [2019-12-27 16:45:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:21,882 INFO L93 Difference]: Finished difference Result 1135 states and 2453 transitions. [2019-12-27 16:45:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:45:21,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 16:45:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:21,887 INFO L225 Difference]: With dead ends: 1135 [2019-12-27 16:45:21,888 INFO L226 Difference]: Without dead ends: 1135 [2019-12-27 16:45:21,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-12-27 16:45:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1047. [2019-12-27 16:45:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-27 16:45:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2300 transitions. [2019-12-27 16:45:21,909 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2300 transitions. Word has length 51 [2019-12-27 16:45:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:21,909 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2300 transitions. [2019-12-27 16:45:21,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2300 transitions. [2019-12-27 16:45:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:45:21,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:21,912 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] [2019-12-27 16:45:21,912 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-27 16:45:21,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:21,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655932746] [2019-12-27 16:45:21,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:22,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655932746] [2019-12-27 16:45:22,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:22,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:22,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1844277400] [2019-12-27 16:45:22,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:22,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:22,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 93 transitions. [2019-12-27 16:45:22,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:22,157 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:22,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:22,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:22,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:22,158 INFO L87 Difference]: Start difference. First operand 1047 states and 2300 transitions. Second operand 3 states. [2019-12-27 16:45:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:22,173 INFO L93 Difference]: Finished difference Result 1046 states and 2298 transitions. [2019-12-27 16:45:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:22,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:45:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:22,176 INFO L225 Difference]: With dead ends: 1046 [2019-12-27 16:45:22,176 INFO L226 Difference]: Without dead ends: 1046 [2019-12-27 16:45:22,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-27 16:45:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 931. [2019-12-27 16:45:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 16:45:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2087 transitions. [2019-12-27 16:45:22,194 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2087 transitions. Word has length 51 [2019-12-27 16:45:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:22,194 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 2087 transitions. [2019-12-27 16:45:22,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2087 transitions. [2019-12-27 16:45:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:45:22,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:22,197 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] [2019-12-27 16:45:22,197 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-27 16:45:22,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:22,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224882184] [2019-12-27 16:45:22,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:22,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224882184] [2019-12-27 16:45:22,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:22,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:45:22,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108045042] [2019-12-27 16:45:22,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:22,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:22,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 16:45:22,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:22,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:45:22,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:45:22,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:45:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:45:22,425 INFO L87 Difference]: Start difference. First operand 931 states and 2087 transitions. Second operand 8 states. [2019-12-27 16:45:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:23,153 INFO L93 Difference]: Finished difference Result 1409 states and 2970 transitions. [2019-12-27 16:45:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:45:23,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 16:45:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:23,160 INFO L225 Difference]: With dead ends: 1409 [2019-12-27 16:45:23,160 INFO L226 Difference]: Without dead ends: 1409 [2019-12-27 16:45:23,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:45:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-12-27 16:45:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 736. [2019-12-27 16:45:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 16:45:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1583 transitions. [2019-12-27 16:45:23,178 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1583 transitions. Word has length 52 [2019-12-27 16:45:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:23,178 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1583 transitions. [2019-12-27 16:45:23,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:45:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1583 transitions. [2019-12-27 16:45:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:45:23,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:23,181 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] [2019-12-27 16:45:23,181 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-27 16:45:23,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:23,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042797] [2019-12-27 16:45:23,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:23,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042797] [2019-12-27 16:45:23,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:23,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:23,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884523521] [2019-12-27 16:45:23,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:23,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:23,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 93 transitions. [2019-12-27 16:45:23,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:23,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:23,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:23,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:23,378 INFO L87 Difference]: Start difference. First operand 736 states and 1583 transitions. Second operand 3 states. [2019-12-27 16:45:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:23,429 INFO L93 Difference]: Finished difference Result 900 states and 1911 transitions. [2019-12-27 16:45:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:23,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 16:45:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:23,431 INFO L225 Difference]: With dead ends: 900 [2019-12-27 16:45:23,431 INFO L226 Difference]: Without dead ends: 900 [2019-12-27 16:45:23,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-27 16:45:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 750. [2019-12-27 16:45:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-27 16:45:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1614 transitions. [2019-12-27 16:45:23,444 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1614 transitions. Word has length 52 [2019-12-27 16:45:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:23,445 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1614 transitions. [2019-12-27 16:45:23,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1614 transitions. [2019-12-27 16:45:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:23,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:23,447 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] [2019-12-27 16:45:23,447 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-27 16:45:23,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:23,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419179468] [2019-12-27 16:45:23,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:23,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419179468] [2019-12-27 16:45:23,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:23,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:45:23,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071313062] [2019-12-27 16:45:23,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:23,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:23,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:45:23,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:23,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:45:23,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:23,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:23,587 INFO L87 Difference]: Start difference. First operand 750 states and 1614 transitions. Second operand 5 states. [2019-12-27 16:45:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:23,858 INFO L93 Difference]: Finished difference Result 1421 states and 3046 transitions. [2019-12-27 16:45:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:23,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 16:45:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:23,863 INFO L225 Difference]: With dead ends: 1421 [2019-12-27 16:45:23,863 INFO L226 Difference]: Without dead ends: 1421 [2019-12-27 16:45:23,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-27 16:45:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 830. [2019-12-27 16:45:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 16:45:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1816 transitions. [2019-12-27 16:45:23,882 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1816 transitions. Word has length 53 [2019-12-27 16:45:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:23,882 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1816 transitions. [2019-12-27 16:45:23,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1816 transitions. [2019-12-27 16:45:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:23,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:23,885 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] [2019-12-27 16:45:23,885 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:23,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-27 16:45:23,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:23,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164802345] [2019-12-27 16:45:23,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:23,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-27 16:45:23,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164802345] [2019-12-27 16:45:23,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:23,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:45:23,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431390476] [2019-12-27 16:45:23,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:23,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:24,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:45:24,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:24,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:24,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:24,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:24,032 INFO L87 Difference]: Start difference. First operand 830 states and 1816 transitions. Second operand 5 states. [2019-12-27 16:45:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:24,274 INFO L93 Difference]: Finished difference Result 997 states and 2134 transitions. [2019-12-27 16:45:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:45:24,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 16:45:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:24,276 INFO L225 Difference]: With dead ends: 997 [2019-12-27 16:45:24,276 INFO L226 Difference]: Without dead ends: 997 [2019-12-27 16:45:24,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-27 16:45:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 883. [2019-12-27 16:45:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-27 16:45:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1913 transitions. [2019-12-27 16:45:24,292 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1913 transitions. Word has length 53 [2019-12-27 16:45:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:24,292 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1913 transitions. [2019-12-27 16:45:24,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1913 transitions. [2019-12-27 16:45:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:24,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:24,295 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] [2019-12-27 16:45:24,295 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-27 16:45:24,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:24,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415060847] [2019-12-27 16:45:24,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:24,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415060847] [2019-12-27 16:45:24,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:24,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:24,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62353627] [2019-12-27 16:45:24,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:24,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:24,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:45:24,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:24,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:45:24,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:45:24,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:45:24,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:45:24,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:45:24,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:24,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:45:24,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:45:24,756 INFO L87 Difference]: Start difference. First operand 883 states and 1913 transitions. Second operand 11 states. [2019-12-27 16:45:27,140 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 16:45:27,405 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 16:45:28,557 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 16:45:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:29,440 INFO L93 Difference]: Finished difference Result 3569 states and 7301 transitions. [2019-12-27 16:45:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 16:45:29,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 16:45:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:29,446 INFO L225 Difference]: With dead ends: 3569 [2019-12-27 16:45:29,446 INFO L226 Difference]: Without dead ends: 2221 [2019-12-27 16:45:29,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=579, Invalid=2727, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 16:45:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-12-27 16:45:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 943. [2019-12-27 16:45:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-12-27 16:45:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2014 transitions. [2019-12-27 16:45:29,474 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2014 transitions. Word has length 53 [2019-12-27 16:45:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:29,474 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 2014 transitions. [2019-12-27 16:45:29,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:45:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2014 transitions. [2019-12-27 16:45:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:29,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:29,477 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] [2019-12-27 16:45:29,477 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-27 16:45:29,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:29,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582593779] [2019-12-27 16:45:29,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:29,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582593779] [2019-12-27 16:45:29,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:29,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81231543] [2019-12-27 16:45:29,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:29,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:29,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 106 transitions. [2019-12-27 16:45:29,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:29,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:45:29,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:45:29,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:45:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:29,657 INFO L87 Difference]: Start difference. First operand 943 states and 2014 transitions. Second operand 6 states. [2019-12-27 16:45:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:29,923 INFO L93 Difference]: Finished difference Result 1140 states and 2393 transitions. [2019-12-27 16:45:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:29,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 16:45:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:29,926 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 16:45:29,926 INFO L226 Difference]: Without dead ends: 1140 [2019-12-27 16:45:29,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:45:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-12-27 16:45:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 777. [2019-12-27 16:45:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-27 16:45:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1634 transitions. [2019-12-27 16:45:29,942 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1634 transitions. Word has length 53 [2019-12-27 16:45:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:29,942 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1634 transitions. [2019-12-27 16:45:29,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:45:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1634 transitions. [2019-12-27 16:45:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:29,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:29,944 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] [2019-12-27 16:45:29,944 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-27 16:45:29,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:29,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076588597] [2019-12-27 16:45:29,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:30,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:45:30,050 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:45:30,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35|) |v_ULTIMATE.start_main_~#t841~0.offset_23| 0)) |v_#memory_int_13|) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35|) 0) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t841~0.base_35| 4) |v_#length_15|) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t841~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t841~0.offset_23| 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ULTIMATE.start_main_~#t841~0.base=|v_ULTIMATE.start_main_~#t841~0.base_35|, #length=|v_#length_15|, ULTIMATE.start_main_~#t841~0.offset=|v_ULTIMATE.start_main_~#t841~0.offset_23|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t842~0.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t841~0.base, #length, ULTIMATE.start_main_~#t841~0.offset, ~y~0, ULTIMATE.start_main_~#t842~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:45:30,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0~0_In386449535 ~a$w_buff1~0_Out386449535) (= P0Thread1of1ForFork0_~arg.base_Out386449535 |P0Thread1of1ForFork0_#in~arg.base_In386449535|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out386449535| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out386449535) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out386449535| 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In386449535| P0Thread1of1ForFork0_~arg.offset_Out386449535) (= 0 (mod ~a$w_buff1_used~0_Out386449535 256)) (= ~a$w_buff0_used~0_Out386449535 1) (= ~a$w_buff0~0_Out386449535 1) (= ~a$w_buff1_used~0_Out386449535 ~a$w_buff0_used~0_In386449535)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In386449535|, ~a$w_buff0~0=~a$w_buff0~0_In386449535, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In386449535|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In386449535} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In386449535|, ~a$w_buff1~0=~a$w_buff1~0_Out386449535, ~a$w_buff0~0=~a$w_buff0~0_Out386449535, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out386449535, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In386449535|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out386449535, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out386449535, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out386449535, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out386449535|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out386449535} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:45:30,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t842~0.base_10| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10|) 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10| 1) |v_#valid_19|) (= |v_ULTIMATE.start_main_~#t842~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10|) |v_ULTIMATE.start_main_~#t842~0.offset_9| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t842~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t842~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t842~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t842~0.offset, #length] because there is no mapped edge [2019-12-27 16:45:30,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1505736847 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1505736847 256)))) (or (= (mod ~a$w_buff0_used~0_In1505736847 256) 0) (and (= 0 (mod ~a$r_buff1_thd2~0_In1505736847 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In1505736847 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite23_Out1505736847| ~a$w_buff1_used~0_In1505736847) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1505736847| |P1Thread1of1ForFork1_#t~ite24_Out1505736847|)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1505736847| ~a$w_buff1_used~0_In1505736847) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In1505736847| |P1Thread1of1ForFork1_#t~ite23_Out1505736847|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1505736847, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1505736847, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1505736847|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505736847, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505736847, ~weak$$choice2~0=~weak$$choice2~0_In1505736847} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1505736847, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1505736847|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1505736847, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1505736847|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505736847, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1505736847, ~weak$$choice2~0=~weak$$choice2~0_In1505736847} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:45:30,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:45:30,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In727094564 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In727094564 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out727094564| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out727094564| ~a$w_buff0_used~0_In727094564) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In727094564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In727094564} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out727094564|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In727094564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In727094564} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:45:30,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In728450581 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In728450581 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In728450581 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In728450581 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out728450581| 0)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In728450581 |P0Thread1of1ForFork0_#t~ite6_Out728450581|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In728450581, ~a$w_buff0_used~0=~a$w_buff0_used~0_In728450581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In728450581, ~a$w_buff1_used~0=~a$w_buff1_used~0_In728450581} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out728450581|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In728450581, ~a$w_buff0_used~0=~a$w_buff0_used~0_In728450581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In728450581, ~a$w_buff1_used~0=~a$w_buff1_used~0_In728450581} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:45:30,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In201840100 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In201840100 256)))) (or (and (= ~a$r_buff0_thd1~0_In201840100 ~a$r_buff0_thd1~0_Out201840100) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out201840100) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In201840100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In201840100} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out201840100|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In201840100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out201840100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:45:30,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2056178336 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-2056178336 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-2056178336 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-2056178336 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2056178336| ~a$r_buff1_thd1~0_In-2056178336) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2056178336| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2056178336, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2056178336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2056178336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2056178336} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2056178336, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2056178336|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2056178336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2056178336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2056178336} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:45:30,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:45:30,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:45:30,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1133523257| |P1Thread1of1ForFork1_#t~ite32_Out-1133523257|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1133523257 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1133523257 256)))) (or (and (= ~a$w_buff1~0_In-1133523257 |P1Thread1of1ForFork1_#t~ite32_Out-1133523257|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~a~0_In-1133523257 |P1Thread1of1ForFork1_#t~ite32_Out-1133523257|)))) InVars {~a~0=~a~0_In-1133523257, ~a$w_buff1~0=~a$w_buff1~0_In-1133523257, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1133523257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1133523257} OutVars{~a~0=~a~0_In-1133523257, ~a$w_buff1~0=~a$w_buff1~0_In-1133523257, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1133523257, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1133523257|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1133523257|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1133523257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:45:30,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1729461046 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1729461046 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1729461046| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1729461046| ~a$w_buff0_used~0_In1729461046) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1729461046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1729461046} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1729461046|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1729461046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1729461046} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:45:30,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1403978686 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1403978686 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In1403978686 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1403978686 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1403978686 |P1Thread1of1ForFork1_#t~ite35_Out1403978686|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1403978686|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1403978686, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1403978686, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1403978686, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1403978686} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1403978686, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1403978686, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1403978686, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1403978686|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1403978686} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:45:30,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-473066989 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-473066989 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-473066989| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-473066989| ~a$r_buff0_thd2~0_In-473066989) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-473066989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-473066989} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-473066989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-473066989, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-473066989|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:45:30,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-494064678 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-494064678 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-494064678 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-494064678 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-494064678 |P1Thread1of1ForFork1_#t~ite37_Out-494064678|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-494064678| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-494064678, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-494064678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-494064678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-494064678} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-494064678, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-494064678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-494064678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-494064678, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-494064678|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:45:30,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:45:30,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:45:30,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In535165553 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In535165553 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In535165553 |ULTIMATE.start_main_#t~ite40_Out535165553|)) (and (= ~a$w_buff1~0_In535165553 |ULTIMATE.start_main_#t~ite40_Out535165553|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In535165553, ~a$w_buff1~0=~a$w_buff1~0_In535165553, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In535165553, ~a$w_buff1_used~0=~a$w_buff1_used~0_In535165553} OutVars{~a~0=~a~0_In535165553, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out535165553|, ~a$w_buff1~0=~a$w_buff1~0_In535165553, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In535165553, ~a$w_buff1_used~0=~a$w_buff1_used~0_In535165553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:45:30,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:45:30,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-397007162 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-397007162 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-397007162 |ULTIMATE.start_main_#t~ite42_Out-397007162|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-397007162|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-397007162, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-397007162} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-397007162, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-397007162, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-397007162|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:45:30,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-963353330 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-963353330 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-963353330 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-963353330 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-963353330|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-963353330 |ULTIMATE.start_main_#t~ite43_Out-963353330|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-963353330, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-963353330, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-963353330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-963353330} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-963353330, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-963353330, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-963353330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-963353330, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-963353330|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:45:30,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-2125092428 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2125092428 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-2125092428| ~a$r_buff0_thd0~0_In-2125092428) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-2125092428| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2125092428, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2125092428} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2125092428, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2125092428, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2125092428|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:45:30,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-2015714118 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2015714118 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-2015714118 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-2015714118 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-2015714118| ~a$r_buff1_thd0~0_In-2015714118) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out-2015714118| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2015714118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2015714118, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2015714118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2015714118} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2015714118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2015714118, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2015714118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2015714118, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2015714118|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:45:30,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:45:30,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:45:30 BasicIcfg [2019-12-27 16:45:30,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:45:30,170 INFO L168 Benchmark]: Toolchain (without parser) took 21807.94 ms. Allocated memory was 145.2 MB in the beginning and 632.8 MB in the end (delta: 487.6 MB). Free memory was 102.0 MB in the beginning and 47.0 MB in the end (delta: 55.0 MB). Peak memory consumption was 542.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,170 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.11 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.92 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,172 INFO L168 Benchmark]: Boogie Preprocessor took 56.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,172 INFO L168 Benchmark]: RCFGBuilder took 793.56 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 106.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,173 INFO L168 Benchmark]: TraceAbstraction took 20079.23 ms. Allocated memory was 202.4 MB in the beginning and 632.8 MB in the end (delta: 430.4 MB). Free memory was 105.9 MB in the beginning and 47.0 MB in the end (delta: 58.9 MB). Peak memory consumption was 489.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:30,179 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.11 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.92 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.56 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 106.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20079.23 ms. Allocated memory was 202.4 MB in the beginning and 632.8 MB in the end (delta: 430.4 MB). Free memory was 105.9 MB in the beginning and 47.0 MB in the end (delta: 58.9 MB). Peak memory consumption was 489.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 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) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 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 [L791] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, 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=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 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) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 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 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 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 [L825] 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 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2546 SDtfs, 2888 SDslu, 5016 SDs, 0 SdLazy, 4036 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 50 SyntacticMatches, 30 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 6144 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 104965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...