/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:07:30,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:07:30,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:07:30,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:07:30,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:07:30,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:07:30,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:07:30,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:07:30,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:07:30,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:07:30,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:07:30,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:07:30,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:07:30,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:07:30,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:07:30,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:07:30,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:07:30,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:07:30,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:07:30,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:07:30,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:07:30,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:07:30,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:07:30,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:07:30,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:07:30,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:07:30,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:07:30,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:07:30,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:07:30,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:07:30,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:07:30,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:07:30,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:07:30,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:07:30,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:07:30,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:07:30,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:07:30,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:07:30,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:07:30,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:07:30,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:07:30,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:07:30,164 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:07:30,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:07:30,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:07:30,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:07:30,167 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:07:30,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:07:30,168 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:07:30,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:07:30,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:07:30,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:07:30,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:07:30,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:07:30,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:07:30,171 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:07:30,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:07:30,171 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:07:30,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:07:30,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:07:30,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:07:30,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:07:30,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:07:30,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:07:30,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:07:30,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:07:30,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:07:30,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:07:30,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:07:30,174 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:07:30,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:07:30,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:07:30,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:07:30,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:07:30,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:07:30,488 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:07:30,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-21 23:07:30,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d663ee9/72d971a369cd4d7bbfbeb407a81ea44a/FLAGdd32382f8 [2020-10-21 23:07:31,143 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:07:31,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-21 23:07:31,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d663ee9/72d971a369cd4d7bbfbeb407a81ea44a/FLAGdd32382f8 [2020-10-21 23:07:31,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6d663ee9/72d971a369cd4d7bbfbeb407a81ea44a [2020-10-21 23:07:31,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:07:31,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:07:31,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:07:31,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:07:31,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:07:31,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:07:31" (1/1) ... [2020-10-21 23:07:31,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4512dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:31, skipping insertion in model container [2020-10-21 23:07:31,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:07:31" (1/1) ... [2020-10-21 23:07:31,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:07:31,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:07:32,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:07:32,237 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:07:32,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:07:32,425 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:07:32,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32 WrapperNode [2020-10-21 23:07:32,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:07:32,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:07:32,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:07:32,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:07:32,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:07:32,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:07:32,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:07:32,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:07:32,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (1/1) ... [2020-10-21 23:07:32,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:07:32,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:07:32,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:07:32,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:07:32,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (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 [2020-10-21 23:07:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:07:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:07:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:07:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:07:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:07:32,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:07:32,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:07:32,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:07:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:07:32,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:07:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:07:32,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:07:32,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:07:32,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:07:32,667 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:07:36,756 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:07:36,757 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:07:36,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:07:36 BoogieIcfgContainer [2020-10-21 23:07:36,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:07:36,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:07:36,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:07:36,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:07:36,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:07:31" (1/3) ... [2020-10-21 23:07:36,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0d18eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:07:36, skipping insertion in model container [2020-10-21 23:07:36,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:32" (2/3) ... [2020-10-21 23:07:36,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0d18eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:07:36, skipping insertion in model container [2020-10-21 23:07:36,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:07:36" (3/3) ... [2020-10-21 23:07:36,772 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2020-10-21 23:07:36,786 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:07:36,786 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:07:36,797 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:07:36,798 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:07:36,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,929 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,954 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,958 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:36,960 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:07:36,982 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:07:37,014 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:07:37,015 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:07:37,015 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:07:37,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:07:37,015 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:07:37,015 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:07:37,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:07:37,016 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:07:37,034 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:07:37,035 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:37,038 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:37,041 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:37,104 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-10-21 23:07:37,105 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:07:37,111 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-21 23:07:37,114 INFO L116 LiptonReduction]: Number of co-enabled transitions 1970 [2020-10-21 23:07:39,065 WARN L193 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-21 23:07:39,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 23:07:39,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:07:39,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:07:39,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:07:40,355 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-21 23:07:40,828 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:07:41,741 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:07:42,868 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 23:07:43,244 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 23:07:44,099 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-21 23:07:44,396 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 23:07:45,413 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-21 23:07:45,737 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 23:07:46,327 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-21 23:07:46,560 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-21 23:07:46,606 INFO L131 LiptonReduction]: Checked pairs total: 5977 [2020-10-21 23:07:46,607 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-10-21 23:07:46,633 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-21 23:07:46,729 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 986 states. [2020-10-21 23:07:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states. [2020-10-21 23:07:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:07:46,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:46,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:07:46,742 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1759824079, now seen corresponding path program 1 times [2020-10-21 23:07:46,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:46,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961759321] [2020-10-21 23:07:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:46,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961759321] [2020-10-21 23:07:46,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:46,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:47,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14967874] [2020-10-21 23:07:47,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:47,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:47,024 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 3 states. [2020-10-21 23:07:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:47,245 INFO L93 Difference]: Finished difference Result 824 states and 2607 transitions. [2020-10-21 23:07:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:47,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:07:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:47,289 INFO L225 Difference]: With dead ends: 824 [2020-10-21 23:07:47,289 INFO L226 Difference]: Without dead ends: 674 [2020-10-21 23:07:47,293 INFO L677 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 [2020-10-21 23:07:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-10-21 23:07:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-21 23:07:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-21 23:07:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2092 transitions. [2020-10-21 23:07:47,441 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2092 transitions. Word has length 5 [2020-10-21 23:07:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:47,442 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 2092 transitions. [2020-10-21 23:07:47,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2092 transitions. [2020-10-21 23:07:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:07:47,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:47,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:47,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:07:47,445 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1756462018, now seen corresponding path program 1 times [2020-10-21 23:07:47,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:47,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075336783] [2020-10-21 23:07:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:47,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075336783] [2020-10-21 23:07:47,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:47,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:47,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941260722] [2020-10-21 23:07:47,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:47,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:47,588 INFO L87 Difference]: Start difference. First operand 674 states and 2092 transitions. Second operand 3 states. [2020-10-21 23:07:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:47,670 INFO L93 Difference]: Finished difference Result 659 states and 2035 transitions. [2020-10-21 23:07:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:47,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:07:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:47,678 INFO L225 Difference]: With dead ends: 659 [2020-10-21 23:07:47,678 INFO L226 Difference]: Without dead ends: 659 [2020-10-21 23:07:47,679 INFO L677 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 [2020-10-21 23:07:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-21 23:07:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-10-21 23:07:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-21 23:07:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2035 transitions. [2020-10-21 23:07:47,708 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 2035 transitions. Word has length 9 [2020-10-21 23:07:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:47,710 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 2035 transitions. [2020-10-21 23:07:47,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 2035 transitions. [2020-10-21 23:07:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:07:47,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:47,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:47,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:07:47,712 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1826518334, now seen corresponding path program 1 times [2020-10-21 23:07:47,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:47,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890391249] [2020-10-21 23:07:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:47,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890391249] [2020-10-21 23:07:47,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:47,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:47,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963567156] [2020-10-21 23:07:47,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:47,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:47,834 INFO L87 Difference]: Start difference. First operand 659 states and 2035 transitions. Second operand 3 states. [2020-10-21 23:07:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:47,852 INFO L93 Difference]: Finished difference Result 599 states and 1822 transitions. [2020-10-21 23:07:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:47,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:07:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:47,858 INFO L225 Difference]: With dead ends: 599 [2020-10-21 23:07:47,859 INFO L226 Difference]: Without dead ends: 599 [2020-10-21 23:07:47,859 INFO L677 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 [2020-10-21 23:07:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-21 23:07:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2020-10-21 23:07:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-10-21 23:07:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1822 transitions. [2020-10-21 23:07:47,881 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1822 transitions. Word has length 10 [2020-10-21 23:07:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:47,881 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 1822 transitions. [2020-10-21 23:07:47,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1822 transitions. [2020-10-21 23:07:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:07:47,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:47,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:47,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:07:47,884 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1974210350, now seen corresponding path program 1 times [2020-10-21 23:07:47,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:47,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24508278] [2020-10-21 23:07:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:47,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24508278] [2020-10-21 23:07:47,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:47,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:47,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116766747] [2020-10-21 23:07:47,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:47,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:47,980 INFO L87 Difference]: Start difference. First operand 599 states and 1822 transitions. Second operand 3 states. [2020-10-21 23:07:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:48,007 INFO L93 Difference]: Finished difference Result 584 states and 1770 transitions. [2020-10-21 23:07:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:07:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:48,013 INFO L225 Difference]: With dead ends: 584 [2020-10-21 23:07:48,014 INFO L226 Difference]: Without dead ends: 584 [2020-10-21 23:07:48,014 INFO L677 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 [2020-10-21 23:07:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-10-21 23:07:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-10-21 23:07:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-10-21 23:07:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1770 transitions. [2020-10-21 23:07:48,035 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1770 transitions. Word has length 12 [2020-10-21 23:07:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:48,035 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1770 transitions. [2020-10-21 23:07:48,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1770 transitions. [2020-10-21 23:07:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:07:48,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:48,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:48,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:07:48,038 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1070334446, now seen corresponding path program 1 times [2020-10-21 23:07:48,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:48,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535195979] [2020-10-21 23:07:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:48,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535195979] [2020-10-21 23:07:48,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:48,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:07:48,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176797436] [2020-10-21 23:07:48,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:07:48,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:07:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:07:48,155 INFO L87 Difference]: Start difference. First operand 584 states and 1770 transitions. Second operand 4 states. [2020-10-21 23:07:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:48,187 INFO L93 Difference]: Finished difference Result 776 states and 2318 transitions. [2020-10-21 23:07:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:07:48,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:07:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:48,192 INFO L225 Difference]: With dead ends: 776 [2020-10-21 23:07:48,192 INFO L226 Difference]: Without dead ends: 416 [2020-10-21 23:07:48,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-10-21 23:07:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-10-21 23:07:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-21 23:07:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1184 transitions. [2020-10-21 23:07:48,207 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1184 transitions. Word has length 13 [2020-10-21 23:07:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:48,207 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1184 transitions. [2020-10-21 23:07:48,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:07:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1184 transitions. [2020-10-21 23:07:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:48,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:48,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:48,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:07:48,210 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1397561244, now seen corresponding path program 1 times [2020-10-21 23:07:48,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:48,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401023467] [2020-10-21 23:07:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:48,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401023467] [2020-10-21 23:07:48,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:48,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:48,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640845083] [2020-10-21 23:07:48,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:48,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:48,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:48,481 INFO L87 Difference]: Start difference. First operand 416 states and 1184 transitions. Second operand 8 states. [2020-10-21 23:07:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:48,786 INFO L93 Difference]: Finished difference Result 468 states and 1339 transitions. [2020-10-21 23:07:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:07:48,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:48,791 INFO L225 Difference]: With dead ends: 468 [2020-10-21 23:07:48,792 INFO L226 Difference]: Without dead ends: 468 [2020-10-21 23:07:48,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-10-21 23:07:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 455. [2020-10-21 23:07:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-21 23:07:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1297 transitions. [2020-10-21 23:07:48,814 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1297 transitions. Word has length 15 [2020-10-21 23:07:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:48,814 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1297 transitions. [2020-10-21 23:07:48,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1297 transitions. [2020-10-21 23:07:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:48,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:48,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:48,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:07:48,817 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1780486270, now seen corresponding path program 2 times [2020-10-21 23:07:48,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:48,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262821737] [2020-10-21 23:07:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:49,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262821737] [2020-10-21 23:07:49,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:49,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:49,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526844107] [2020-10-21 23:07:49,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:49,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:49,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:49,098 INFO L87 Difference]: Start difference. First operand 455 states and 1297 transitions. Second operand 8 states. [2020-10-21 23:07:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:49,511 INFO L93 Difference]: Finished difference Result 481 states and 1381 transitions. [2020-10-21 23:07:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:49,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:49,515 INFO L225 Difference]: With dead ends: 481 [2020-10-21 23:07:49,516 INFO L226 Difference]: Without dead ends: 481 [2020-10-21 23:07:49,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:07:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-10-21 23:07:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 468. [2020-10-21 23:07:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-21 23:07:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1339 transitions. [2020-10-21 23:07:49,533 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1339 transitions. Word has length 15 [2020-10-21 23:07:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:49,534 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1339 transitions. [2020-10-21 23:07:49,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1339 transitions. [2020-10-21 23:07:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:49,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:49,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:49,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:07:49,536 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1526214500, now seen corresponding path program 3 times [2020-10-21 23:07:49,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:49,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509632576] [2020-10-21 23:07:49,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:49,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509632576] [2020-10-21 23:07:49,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:49,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:49,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946389264] [2020-10-21 23:07:49,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:49,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:49,827 INFO L87 Difference]: Start difference. First operand 468 states and 1339 transitions. Second operand 8 states. [2020-10-21 23:07:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:50,126 INFO L93 Difference]: Finished difference Result 537 states and 1546 transitions. [2020-10-21 23:07:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:07:50,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:50,132 INFO L225 Difference]: With dead ends: 537 [2020-10-21 23:07:50,132 INFO L226 Difference]: Without dead ends: 537 [2020-10-21 23:07:50,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-21 23:07:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 508. [2020-10-21 23:07:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-10-21 23:07:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1467 transitions. [2020-10-21 23:07:50,150 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1467 transitions. Word has length 15 [2020-10-21 23:07:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:50,150 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 1467 transitions. [2020-10-21 23:07:50,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1467 transitions. [2020-10-21 23:07:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:50,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:50,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:50,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:07:50,153 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:50,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1845040438, now seen corresponding path program 4 times [2020-10-21 23:07:50,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:50,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203156470] [2020-10-21 23:07:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:50,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203156470] [2020-10-21 23:07:50,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:50,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:07:50,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812023758] [2020-10-21 23:07:50,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:50,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:50,338 INFO L87 Difference]: Start difference. First operand 508 states and 1467 transitions. Second operand 5 states. [2020-10-21 23:07:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:50,514 INFO L93 Difference]: Finished difference Result 606 states and 1763 transitions. [2020-10-21 23:07:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:50,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:07:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:50,520 INFO L225 Difference]: With dead ends: 606 [2020-10-21 23:07:50,520 INFO L226 Difference]: Without dead ends: 606 [2020-10-21 23:07:50,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-10-21 23:07:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 524. [2020-10-21 23:07:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-10-21 23:07:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1508 transitions. [2020-10-21 23:07:50,542 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1508 transitions. Word has length 15 [2020-10-21 23:07:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:50,542 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 1508 transitions. [2020-10-21 23:07:50,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1508 transitions. [2020-10-21 23:07:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:07:50,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:50,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:50,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:07:50,544 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1930921873, now seen corresponding path program 1 times [2020-10-21 23:07:50,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:50,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842279663] [2020-10-21 23:07:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:51,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842279663] [2020-10-21 23:07:51,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:51,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:51,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55006128] [2020-10-21 23:07:51,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:51,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:51,051 INFO L87 Difference]: Start difference. First operand 524 states and 1508 transitions. Second operand 9 states. [2020-10-21 23:07:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:51,362 INFO L93 Difference]: Finished difference Result 589 states and 1692 transitions. [2020-10-21 23:07:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:51,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-21 23:07:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:51,371 INFO L225 Difference]: With dead ends: 589 [2020-10-21 23:07:51,372 INFO L226 Difference]: Without dead ends: 589 [2020-10-21 23:07:51,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-10-21 23:07:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 524. [2020-10-21 23:07:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-10-21 23:07:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1508 transitions. [2020-10-21 23:07:51,390 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1508 transitions. Word has length 16 [2020-10-21 23:07:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:51,392 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 1508 transitions. [2020-10-21 23:07:51,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1508 transitions. [2020-10-21 23:07:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:07:51,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:51,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:51,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:07:51,394 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -374726707, now seen corresponding path program 1 times [2020-10-21 23:07:51,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:51,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060616885] [2020-10-21 23:07:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:51,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060616885] [2020-10-21 23:07:51,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:51,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:07:51,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524610842] [2020-10-21 23:07:51,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:51,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:51,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:51,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:51,542 INFO L87 Difference]: Start difference. First operand 524 states and 1508 transitions. Second operand 5 states. [2020-10-21 23:07:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:51,754 INFO L93 Difference]: Finished difference Result 704 states and 1986 transitions. [2020-10-21 23:07:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:51,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:07:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:51,766 INFO L225 Difference]: With dead ends: 704 [2020-10-21 23:07:51,766 INFO L226 Difference]: Without dead ends: 668 [2020-10-21 23:07:51,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-10-21 23:07:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 547. [2020-10-21 23:07:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-10-21 23:07:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1562 transitions. [2020-10-21 23:07:51,788 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1562 transitions. Word has length 16 [2020-10-21 23:07:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:51,789 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 1562 transitions. [2020-10-21 23:07:51,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1562 transitions. [2020-10-21 23:07:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:07:51,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:51,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:51,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:07:51,792 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash -374726893, now seen corresponding path program 1 times [2020-10-21 23:07:51,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:51,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922318409] [2020-10-21 23:07:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:51,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922318409] [2020-10-21 23:07:51,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:51,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:07:51,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736500060] [2020-10-21 23:07:51,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:07:51,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:07:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:07:51,998 INFO L87 Difference]: Start difference. First operand 547 states and 1562 transitions. Second operand 4 states. [2020-10-21 23:07:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:52,032 INFO L93 Difference]: Finished difference Result 532 states and 1364 transitions. [2020-10-21 23:07:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:07:52,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 23:07:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:52,036 INFO L225 Difference]: With dead ends: 532 [2020-10-21 23:07:52,036 INFO L226 Difference]: Without dead ends: 394 [2020-10-21 23:07:52,036 INFO L677 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 [2020-10-21 23:07:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-10-21 23:07:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2020-10-21 23:07:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-21 23:07:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 982 transitions. [2020-10-21 23:07:52,048 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 982 transitions. Word has length 16 [2020-10-21 23:07:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:52,049 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 982 transitions. [2020-10-21 23:07:52,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:07:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 982 transitions. [2020-10-21 23:07:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:07:52,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:52,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:52,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:07:52,051 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1479250304, now seen corresponding path program 1 times [2020-10-21 23:07:52,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:52,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531082956] [2020-10-21 23:07:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:52,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531082956] [2020-10-21 23:07:52,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:52,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:07:52,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263428902] [2020-10-21 23:07:52,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:52,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:52,179 INFO L87 Difference]: Start difference. First operand 394 states and 982 transitions. Second operand 5 states. [2020-10-21 23:07:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:52,230 INFO L93 Difference]: Finished difference Result 339 states and 792 transitions. [2020-10-21 23:07:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:52,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 23:07:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:52,233 INFO L225 Difference]: With dead ends: 339 [2020-10-21 23:07:52,233 INFO L226 Difference]: Without dead ends: 272 [2020-10-21 23:07:52,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-21 23:07:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 224. [2020-10-21 23:07:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-21 23:07:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 500 transitions. [2020-10-21 23:07:52,240 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 500 transitions. Word has length 17 [2020-10-21 23:07:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:52,241 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 500 transitions. [2020-10-21 23:07:52,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 500 transitions. [2020-10-21 23:07:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:07:52,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:52,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:52,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:07:52,243 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash -670244609, now seen corresponding path program 1 times [2020-10-21 23:07:52,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:52,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022184998] [2020-10-21 23:07:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:52,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022184998] [2020-10-21 23:07:52,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:52,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:52,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459838308] [2020-10-21 23:07:52,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:07:52,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:07:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:52,384 INFO L87 Difference]: Start difference. First operand 224 states and 500 transitions. Second operand 6 states. [2020-10-21 23:07:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:52,456 INFO L93 Difference]: Finished difference Result 205 states and 461 transitions. [2020-10-21 23:07:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:52,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:07:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:52,459 INFO L225 Difference]: With dead ends: 205 [2020-10-21 23:07:52,460 INFO L226 Difference]: Without dead ends: 175 [2020-10-21 23:07:52,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-21 23:07:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2020-10-21 23:07:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-21 23:07:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 366 transitions. [2020-10-21 23:07:52,467 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 366 transitions. Word has length 19 [2020-10-21 23:07:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:52,467 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 366 transitions. [2020-10-21 23:07:52,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:07:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 366 transitions. [2020-10-21 23:07:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:52,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:52,469 INFO L422 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] [2020-10-21 23:07:52,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:07:52,469 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash -682714242, now seen corresponding path program 1 times [2020-10-21 23:07:52,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:52,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123789194] [2020-10-21 23:07:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:52,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123789194] [2020-10-21 23:07:52,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:52,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:52,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289847925] [2020-10-21 23:07:52,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:52,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:52,870 INFO L87 Difference]: Start difference. First operand 163 states and 366 transitions. Second operand 8 states. [2020-10-21 23:07:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:53,210 INFO L93 Difference]: Finished difference Result 221 states and 479 transitions. [2020-10-21 23:07:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:53,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:07:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:53,212 INFO L225 Difference]: With dead ends: 221 [2020-10-21 23:07:53,212 INFO L226 Difference]: Without dead ends: 148 [2020-10-21 23:07:53,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-21 23:07:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-10-21 23:07:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-21 23:07:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 330 transitions. [2020-10-21 23:07:53,217 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 330 transitions. Word has length 22 [2020-10-21 23:07:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:53,217 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 330 transitions. [2020-10-21 23:07:53,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 330 transitions. [2020-10-21 23:07:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:53,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:53,218 INFO L422 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] [2020-10-21 23:07:53,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:07:53,219 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:53,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1105214244, now seen corresponding path program 2 times [2020-10-21 23:07:53,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:53,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382129869] [2020-10-21 23:07:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:53,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382129869] [2020-10-21 23:07:53,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:53,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:53,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894914157] [2020-10-21 23:07:53,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:53,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:53,684 INFO L87 Difference]: Start difference. First operand 148 states and 330 transitions. Second operand 9 states. [2020-10-21 23:07:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:54,282 INFO L93 Difference]: Finished difference Result 237 states and 526 transitions. [2020-10-21 23:07:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-21 23:07:54,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:54,284 INFO L225 Difference]: With dead ends: 237 [2020-10-21 23:07:54,284 INFO L226 Difference]: Without dead ends: 194 [2020-10-21 23:07:54,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:07:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-21 23:07:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2020-10-21 23:07:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-21 23:07:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 362 transitions. [2020-10-21 23:07:54,290 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 362 transitions. Word has length 22 [2020-10-21 23:07:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:54,290 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 362 transitions. [2020-10-21 23:07:54,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 362 transitions. [2020-10-21 23:07:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:54,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:54,291 INFO L422 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] [2020-10-21 23:07:54,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:07:54,292 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 639500524, now seen corresponding path program 3 times [2020-10-21 23:07:54,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:54,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977882071] [2020-10-21 23:07:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:54,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977882071] [2020-10-21 23:07:54,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:54,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:54,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283725188] [2020-10-21 23:07:54,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:54,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:54,684 INFO L87 Difference]: Start difference. First operand 162 states and 362 transitions. Second operand 9 states. [2020-10-21 23:07:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:55,187 INFO L93 Difference]: Finished difference Result 235 states and 520 transitions. [2020-10-21 23:07:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:55,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:55,190 INFO L225 Difference]: With dead ends: 235 [2020-10-21 23:07:55,190 INFO L226 Difference]: Without dead ends: 200 [2020-10-21 23:07:55,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:07:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-21 23:07:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2020-10-21 23:07:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-21 23:07:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2020-10-21 23:07:55,195 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 22 [2020-10-21 23:07:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:55,196 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2020-10-21 23:07:55,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2020-10-21 23:07:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:55,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:55,197 INFO L422 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] [2020-10-21 23:07:55,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:07:55,197 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1726037150, now seen corresponding path program 4 times [2020-10-21 23:07:55,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:55,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421099147] [2020-10-21 23:07:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:55,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421099147] [2020-10-21 23:07:55,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:55,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:55,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084013633] [2020-10-21 23:07:55,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:07:55,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:07:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:55,476 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2020-10-21 23:07:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:55,850 INFO L93 Difference]: Finished difference Result 221 states and 481 transitions. [2020-10-21 23:07:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:55,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:07:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:55,852 INFO L225 Difference]: With dead ends: 221 [2020-10-21 23:07:55,852 INFO L226 Difference]: Without dead ends: 192 [2020-10-21 23:07:55,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-21 23:07:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 158. [2020-10-21 23:07:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-21 23:07:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 348 transitions. [2020-10-21 23:07:55,856 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 348 transitions. Word has length 22 [2020-10-21 23:07:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:55,856 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 348 transitions. [2020-10-21 23:07:55,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:07:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 348 transitions. [2020-10-21 23:07:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:55,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:55,857 INFO L422 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] [2020-10-21 23:07:55,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:07:55,858 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1720785598, now seen corresponding path program 5 times [2020-10-21 23:07:55,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:55,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397385843] [2020-10-21 23:07:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:55,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397385843] [2020-10-21 23:07:55,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:55,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:55,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889196148] [2020-10-21 23:07:55,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:07:55,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:07:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:55,983 INFO L87 Difference]: Start difference. First operand 158 states and 348 transitions. Second operand 7 states. [2020-10-21 23:07:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:56,199 INFO L93 Difference]: Finished difference Result 284 states and 629 transitions. [2020-10-21 23:07:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:56,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:07:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:56,202 INFO L225 Difference]: With dead ends: 284 [2020-10-21 23:07:56,202 INFO L226 Difference]: Without dead ends: 158 [2020-10-21 23:07:56,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-21 23:07:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-10-21 23:07:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-21 23:07:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 311 transitions. [2020-10-21 23:07:56,208 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 311 transitions. Word has length 22 [2020-10-21 23:07:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:56,208 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 311 transitions. [2020-10-21 23:07:56,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:07:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 311 transitions. [2020-10-21 23:07:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:56,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:56,210 INFO L422 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] [2020-10-21 23:07:56,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:07:56,210 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 819589220, now seen corresponding path program 6 times [2020-10-21 23:07:56,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:56,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833386051] [2020-10-21 23:07:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:56,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833386051] [2020-10-21 23:07:56,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:56,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:07:56,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450021906] [2020-10-21 23:07:56,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:07:56,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:07:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:56,800 INFO L87 Difference]: Start difference. First operand 141 states and 311 transitions. Second operand 12 states. [2020-10-21 23:07:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:57,441 INFO L93 Difference]: Finished difference Result 229 states and 484 transitions. [2020-10-21 23:07:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:57,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-21 23:07:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:57,443 INFO L225 Difference]: With dead ends: 229 [2020-10-21 23:07:57,443 INFO L226 Difference]: Without dead ends: 195 [2020-10-21 23:07:57,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:07:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-10-21 23:07:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2020-10-21 23:07:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-21 23:07:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 284 transitions. [2020-10-21 23:07:57,448 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 284 transitions. Word has length 22 [2020-10-21 23:07:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:57,449 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 284 transitions. [2020-10-21 23:07:57,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:07:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 284 transitions. [2020-10-21 23:07:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:57,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:57,449 INFO L422 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] [2020-10-21 23:07:57,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:07:57,450 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1237706046, now seen corresponding path program 7 times [2020-10-21 23:07:57,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:57,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596687995] [2020-10-21 23:07:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:57,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596687995] [2020-10-21 23:07:57,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:57,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:57,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949420934] [2020-10-21 23:07:57,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:57,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:57,665 INFO L87 Difference]: Start difference. First operand 130 states and 284 transitions. Second operand 8 states. [2020-10-21 23:07:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:57,960 INFO L93 Difference]: Finished difference Result 168 states and 358 transitions. [2020-10-21 23:07:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:57,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:07:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:57,962 INFO L225 Difference]: With dead ends: 168 [2020-10-21 23:07:57,962 INFO L226 Difference]: Without dead ends: 145 [2020-10-21 23:07:57,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-21 23:07:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2020-10-21 23:07:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-21 23:07:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 278 transitions. [2020-10-21 23:07:57,967 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 278 transitions. Word has length 22 [2020-10-21 23:07:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:57,967 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 278 transitions. [2020-10-21 23:07:57,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 278 transitions. [2020-10-21 23:07:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:57,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:57,968 INFO L422 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] [2020-10-21 23:07:57,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:07:57,969 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 353875500, now seen corresponding path program 8 times [2020-10-21 23:07:57,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:57,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267884602] [2020-10-21 23:07:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:58,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267884602] [2020-10-21 23:07:58,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:58,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:58,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486780033] [2020-10-21 23:07:58,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:58,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:58,366 INFO L87 Difference]: Start difference. First operand 127 states and 278 transitions. Second operand 9 states. [2020-10-21 23:07:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:58,691 INFO L93 Difference]: Finished difference Result 203 states and 436 transitions. [2020-10-21 23:07:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:07:58,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:58,693 INFO L225 Difference]: With dead ends: 203 [2020-10-21 23:07:58,694 INFO L226 Difference]: Without dead ends: 168 [2020-10-21 23:07:58,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:07:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-10-21 23:07:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 120. [2020-10-21 23:07:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-21 23:07:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 259 transitions. [2020-10-21 23:07:58,700 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 259 transitions. Word has length 22 [2020-10-21 23:07:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:58,700 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 259 transitions. [2020-10-21 23:07:58,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 259 transitions. [2020-10-21 23:07:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:58,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:58,701 INFO L422 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] [2020-10-21 23:07:58,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:07:58,701 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2006410622, now seen corresponding path program 9 times [2020-10-21 23:07:58,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:58,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519790372] [2020-10-21 23:07:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:58,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519790372] [2020-10-21 23:07:58,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:58,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:58,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518202147] [2020-10-21 23:07:58,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:07:58,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:07:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:58,991 INFO L87 Difference]: Start difference. First operand 120 states and 259 transitions. Second operand 7 states. [2020-10-21 23:07:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:59,291 INFO L93 Difference]: Finished difference Result 167 states and 357 transitions. [2020-10-21 23:07:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:59,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:07:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:59,292 INFO L225 Difference]: With dead ends: 167 [2020-10-21 23:07:59,292 INFO L226 Difference]: Without dead ends: 119 [2020-10-21 23:07:59,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-21 23:07:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-21 23:07:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-21 23:07:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 255 transitions. [2020-10-21 23:07:59,295 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 255 transitions. Word has length 22 [2020-10-21 23:07:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:59,296 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 255 transitions. [2020-10-21 23:07:59,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:07:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 255 transitions. [2020-10-21 23:07:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:59,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:59,297 INFO L422 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] [2020-10-21 23:07:59,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:07:59,297 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -598593278, now seen corresponding path program 10 times [2020-10-21 23:07:59,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:59,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123391395] [2020-10-21 23:07:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:59,696 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2020-10-21 23:07:59,827 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-10-21 23:07:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:59,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123391395] [2020-10-21 23:07:59,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:59,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:07:59,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471897853] [2020-10-21 23:07:59,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:07:59,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:07:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:59,943 INFO L87 Difference]: Start difference. First operand 119 states and 255 transitions. Second operand 10 states. [2020-10-21 23:08:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:00,679 INFO L93 Difference]: Finished difference Result 173 states and 357 transitions. [2020-10-21 23:08:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:08:00,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-21 23:08:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:00,681 INFO L225 Difference]: With dead ends: 173 [2020-10-21 23:08:00,681 INFO L226 Difference]: Without dead ends: 139 [2020-10-21 23:08:00,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:08:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-21 23:08:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2020-10-21 23:08:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-21 23:08:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 248 transitions. [2020-10-21 23:08:00,685 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 248 transitions. Word has length 22 [2020-10-21 23:08:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:00,686 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 248 transitions. [2020-10-21 23:08:00,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:08:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 248 transitions. [2020-10-21 23:08:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:08:00,687 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:00,687 INFO L422 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] [2020-10-21 23:08:00,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-21 23:08:00,688 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 315766564, now seen corresponding path program 11 times [2020-10-21 23:08:00,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:00,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607980482] [2020-10-21 23:08:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:08:00,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607980482] [2020-10-21 23:08:00,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:00,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:08:00,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890208525] [2020-10-21 23:08:00,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:08:00,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:08:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:08:00,933 INFO L87 Difference]: Start difference. First operand 117 states and 248 transitions. Second operand 7 states. [2020-10-21 23:08:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:01,310 INFO L93 Difference]: Finished difference Result 183 states and 384 transitions. [2020-10-21 23:08:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:08:01,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:08:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:01,312 INFO L225 Difference]: With dead ends: 183 [2020-10-21 23:08:01,312 INFO L226 Difference]: Without dead ends: 117 [2020-10-21 23:08:01,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:08:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-21 23:08:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2020-10-21 23:08:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-21 23:08:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 154 transitions. [2020-10-21 23:08:01,316 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 154 transitions. Word has length 22 [2020-10-21 23:08:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:01,316 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 154 transitions. [2020-10-21 23:08:01,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:08:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 154 transitions. [2020-10-21 23:08:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:08:01,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:01,317 INFO L422 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] [2020-10-21 23:08:01,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-21 23:08:01,317 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 792213172, now seen corresponding path program 12 times [2020-10-21 23:08:01,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:01,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820471438] [2020-10-21 23:08:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:01,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:01,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:01,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:08:01,520 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:08:01,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-21 23:08:01,521 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:08:01,545 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1802] [1802] L863-->L870: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-485467759 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-485467759 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-485467759 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-485467759 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out-485467759 0)) (and (= ~y$w_buff1_used~0_Out-485467759 ~y$w_buff1_used~0_In-485467759) .cse2)) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-485467759 0)) (and .cse5 (= ~y$w_buff0_used~0_In-485467759 ~y$w_buff0_used~0_Out-485467759))) (or (and (or (and .cse2 (= ~y~0_In-485467759 ~y~0_Out-485467759)) (and .cse0 .cse1 (= ~y~0_Out-485467759 ~y$w_buff1~0_In-485467759))) .cse5) (and .cse3 .cse4 (= ~y$w_buff0~0_In-485467759 ~y~0_Out-485467759))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-485467759 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-485467759|) (= ~y$r_buff0_thd0~0_Out-485467759 ~y$r_buff0_thd0~0_In-485467759) (= ~y$r_buff1_thd0~0_Out-485467759 ~y$r_buff1_thd0~0_In-485467759) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-485467759 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-485467759|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-485467759, ~y$w_buff1~0=~y$w_buff1~0_In-485467759, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485467759, ~y$w_buff0~0=~y$w_buff0~0_In-485467759, ~y~0=~y~0_In-485467759, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-485467759, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-485467759} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-485467759, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out-485467759|, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-485467759|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-485467759|, ULTIMATE.start_main_#t~ite83=|ULTIMATE.start_main_#t~ite83_Out-485467759|, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-485467759|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-485467759, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-485467759|, ~y$w_buff1~0=~y$w_buff1~0_In-485467759, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out-485467759|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-485467759, ~y$w_buff0~0=~y$w_buff0~0_In-485467759, ~y~0=~y~0_Out-485467759, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-485467759, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-485467759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite79, ~y~0, ULTIMATE.start_main_#t~ite78, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:08:01,557 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,618 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:08:01,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:01,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:08:01 BasicIcfg [2020-10-21 23:08:01,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:08:01,731 INFO L168 Benchmark]: Toolchain (without parser) took 30181.03 ms. Allocated memory was 138.9 MB in the beginning and 585.6 MB in the end (delta: 446.7 MB). Free memory was 99.4 MB in the beginning and 535.3 MB in the end (delta: -435.9 MB). Peak memory consumption was 421.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,731 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.62 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 98.6 MB in the beginning and 147.7 MB in the end (delta: -49.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.27 ms. Allocated memory is still 200.8 MB. Free memory was 147.0 MB in the beginning and 144.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,733 INFO L168 Benchmark]: Boogie Preprocessor took 53.89 ms. Allocated memory is still 200.8 MB. Free memory was 144.3 MB in the beginning and 141.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,733 INFO L168 Benchmark]: RCFGBuilder took 4202.43 ms. Allocated memory was 200.8 MB in the beginning and 303.6 MB in the end (delta: 102.8 MB). Free memory was 141.0 MB in the beginning and 228.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,734 INFO L168 Benchmark]: TraceAbstraction took 24965.64 ms. Allocated memory was 303.6 MB in the beginning and 585.6 MB in the end (delta: 282.1 MB). Free memory was 228.6 MB in the beginning and 535.3 MB in the end (delta: -306.7 MB). Peak memory consumption was 386.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:01,737 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 872.62 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 98.6 MB in the beginning and 147.7 MB in the end (delta: -49.1 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.27 ms. Allocated memory is still 200.8 MB. Free memory was 147.0 MB in the beginning and 144.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.89 ms. Allocated memory is still 200.8 MB. Free memory was 144.3 MB in the beginning and 141.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4202.43 ms. Allocated memory was 200.8 MB in the beginning and 303.6 MB in the end (delta: 102.8 MB). Free memory was 141.0 MB in the beginning and 228.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24965.64 ms. Allocated memory was 303.6 MB in the beginning and 585.6 MB in the end (delta: 282.1 MB). Free memory was 228.6 MB in the beginning and 535.3 MB in the end (delta: -306.7 MB). Peak memory consumption was 386.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1050 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 86 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 110 PlacesBefore, 37 PlacesAfterwards, 103 TransitionsBefore, 27 TransitionsAfterwards, 1970 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 93 TotalNumberOfCompositions, 5977 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2336; [L855] FCALL, FORK 0 pthread_create(&t2336, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2337; [L857] FCALL, FORK 0 pthread_create(&t2337, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2338; [L859] FCALL, FORK 0 pthread_create(&t2338, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1 [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L744] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe023_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 552 SDtfs, 1002 SDslu, 1318 SDs, 0 SdLazy, 1297 SolverSat, 526 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred 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: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 702 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 111498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...