/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/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:05:38,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:05:38,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:05:38,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:05:38,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:05:38,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:05:38,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:05:38,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:05:38,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:05:38,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:05:38,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:05:38,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:05:38,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:05:38,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:05:38,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:05:38,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:05:38,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:05:38,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:05:38,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:05:38,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:05:38,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:05:38,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:05:38,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:05:38,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:05:38,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:05:38,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:05:38,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:05:38,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:05:38,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:05:38,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:05:38,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:05:38,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:05:38,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:05:38,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:05:38,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:05:38,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:05:38,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:05:38,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:05:38,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:05:38,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:05:38,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:05:38,882 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:05:38,908 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:05:38,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:05:38,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:05:38,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:05:38,910 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:05:38,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:05:38,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:05:38,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:05:38,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:05:38,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:05:38,912 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:05:38,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:05:38,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:05:38,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:05:38,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:05:38,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:05:38,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:05:38,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:05:38,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:05:38,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:05:38,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:05:38,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:05:38,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:05:38,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:05:39,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:05:39,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:05:39,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:05:39,257 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:05:39,257 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:05:39,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2020-10-21 23:05:39,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da051f97a/6ca014d998414cf19e7c5afc5827232d/FLAG4ad5d0ea2 [2020-10-21 23:05:39,951 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:05:39,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2020-10-21 23:05:39,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da051f97a/6ca014d998414cf19e7c5afc5827232d/FLAG4ad5d0ea2 [2020-10-21 23:05:40,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da051f97a/6ca014d998414cf19e7c5afc5827232d [2020-10-21 23:05:40,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:05:40,230 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:05:40,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:05:40,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:05:40,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:05:40,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:05:40" (1/1) ... [2020-10-21 23:05:40,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2100e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:40, skipping insertion in model container [2020-10-21 23:05:40,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:05:40" (1/1) ... [2020-10-21 23:05:40,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:05:40,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:05:40,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:05:40,837 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:05:40,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:05:41,030 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:05:41,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41 WrapperNode [2020-10-21 23:05:41,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:05:41,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:05:41,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:05:41,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:05:41,041 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:05:41" (1/1) ... [2020-10-21 23:05:41,065 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:05:41" (1/1) ... [2020-10-21 23:05:41,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:05:41,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:05:41,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:05:41,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:05:41,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (1/1) ... [2020-10-21 23:05:41,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:05:41,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:05:41,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:05:41,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:05:41,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (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:05:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:05:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:05:41,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:05:41,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:05:41,224 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:05:41,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:05:41,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:05:41,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:05:41,225 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:05:41,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:05:41,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:05:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:05:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:05:41,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:05:41,228 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:05:43,388 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:05:43,389 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:05:43,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:05:43 BoogieIcfgContainer [2020-10-21 23:05:43,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:05:43,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:05:43,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:05:43,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:05:43,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:05:40" (1/3) ... [2020-10-21 23:05:43,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432f33cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:05:43, skipping insertion in model container [2020-10-21 23:05:43,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:41" (2/3) ... [2020-10-21 23:05:43,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432f33cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:05:43, skipping insertion in model container [2020-10-21 23:05:43,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:05:43" (3/3) ... [2020-10-21 23:05:43,405 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2020-10-21 23:05:43,419 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:05:43,419 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:05:43,428 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:05:43,429 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:05:43,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:43,509 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:05:43,525 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:05:43,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:05:43,553 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:05:43,553 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:05:43,554 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:05:43,554 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:05:43,554 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:05:43,554 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:05:43,554 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:05:43,577 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:05:43,578 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:43,581 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:43,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:43,653 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-21 23:05:43,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:05:43,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-21 23:05:43,669 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-21 23:05:44,046 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-21 23:05:45,476 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-21 23:05:45,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:05:45,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:05:45,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 23:05:45,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:05:46,273 WARN L193 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-21 23:05:46,856 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:05:46,963 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:05:47,570 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 23:05:48,223 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-21 23:05:48,526 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-21 23:05:49,756 WARN L193 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-21 23:05:50,049 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-21 23:05:50,458 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-21 23:05:50,621 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 23:05:50,653 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-10-21 23:05:50,653 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-21 23:05:50,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-21 23:05:50,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-21 23:05:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-21 23:05:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:05:50,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:50,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:05:50,731 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-10-21 23:05:50,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:50,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657235250] [2020-10-21 23:05:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:50,962 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:05:50,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657235250] [2020-10-21 23:05:50,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:50,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:50,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438730035] [2020-10-21 23:05:50,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:50,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:50,988 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-21 23:05:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:51,093 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-21 23:05:51,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:51,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:05:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:51,119 INFO L225 Difference]: With dead ends: 687 [2020-10-21 23:05:51,120 INFO L226 Difference]: Without dead ends: 562 [2020-10-21 23:05:51,121 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:05:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-21 23:05:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-21 23:05:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-21 23:05:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-21 23:05:51,248 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-21 23:05:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:51,250 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-21 23:05:51,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-21 23:05:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:05:51,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:51,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:51,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:05:51,252 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-10-21 23:05:51,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:51,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212260140] [2020-10-21 23:05:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:51,409 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:05:51,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212260140] [2020-10-21 23:05:51,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:51,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:51,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045816598] [2020-10-21 23:05:51,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:51,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:51,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:51,413 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-21 23:05:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:51,428 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-21 23:05:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:51,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:05:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:51,435 INFO L225 Difference]: With dead ends: 552 [2020-10-21 23:05:51,436 INFO L226 Difference]: Without dead ends: 552 [2020-10-21 23:05:51,437 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:05:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-21 23:05:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-21 23:05:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-21 23:05:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-21 23:05:51,457 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-21 23:05:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:51,459 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-21 23:05:51,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-21 23:05:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:05:51,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:51,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:51,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:05:51,461 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -762762748, now seen corresponding path program 1 times [2020-10-21 23:05:51,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:51,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635303064] [2020-10-21 23:05:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:51,596 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:05:51,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635303064] [2020-10-21 23:05:51,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:51,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:51,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619788009] [2020-10-21 23:05:51,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:51,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:51,599 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-21 23:05:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:51,615 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-21 23:05:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:51,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:05:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:51,621 INFO L225 Difference]: With dead ends: 529 [2020-10-21 23:05:51,621 INFO L226 Difference]: Without dead ends: 529 [2020-10-21 23:05:51,622 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:05:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-21 23:05:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-21 23:05:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-21 23:05:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-21 23:05:51,639 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 10 [2020-10-21 23:05:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:51,639 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-21 23:05:51,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-21 23:05:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:05:51,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:51,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:51,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:05:51,643 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2124151563, now seen corresponding path program 1 times [2020-10-21 23:05:51,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:51,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090381346] [2020-10-21 23:05:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:51,719 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:05:51,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090381346] [2020-10-21 23:05:51,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:51,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:05:51,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922449997] [2020-10-21 23:05:51,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:51,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:51,722 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-21 23:05:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:51,801 INFO L93 Difference]: Finished difference Result 561 states and 1701 transitions. [2020-10-21 23:05:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:51,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:05:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:51,806 INFO L225 Difference]: With dead ends: 561 [2020-10-21 23:05:51,806 INFO L226 Difference]: Without dead ends: 561 [2020-10-21 23:05:51,807 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:05:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-21 23:05:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2020-10-21 23:05:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-21 23:05:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1701 transitions. [2020-10-21 23:05:51,825 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1701 transitions. Word has length 11 [2020-10-21 23:05:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:51,825 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 1701 transitions. [2020-10-21 23:05:51,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1701 transitions. [2020-10-21 23:05:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:05:51,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:51,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:51,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:05:51,828 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 640929964, now seen corresponding path program 1 times [2020-10-21 23:05:51,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:51,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90810384] [2020-10-21 23:05:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:51,903 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:05:51,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90810384] [2020-10-21 23:05:51,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:51,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:05:51,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310492174] [2020-10-21 23:05:51,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:51,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:51,908 INFO L87 Difference]: Start difference. First operand 561 states and 1701 transitions. Second operand 4 states. [2020-10-21 23:05:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:51,938 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-10-21 23:05:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:51,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:05:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:51,943 INFO L225 Difference]: With dead ends: 677 [2020-10-21 23:05:51,943 INFO L226 Difference]: Without dead ends: 377 [2020-10-21 23:05:51,944 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:05:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-21 23:05:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-21 23:05:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-21 23:05:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-10-21 23:05:51,956 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 12 [2020-10-21 23:05:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:51,957 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-10-21 23:05:51,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-10-21 23:05:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:05:51,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:51,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:51,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:05:51,959 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1424343219, now seen corresponding path program 1 times [2020-10-21 23:05:51,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:51,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20881806] [2020-10-21 23:05:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:52,034 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:05:52,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20881806] [2020-10-21 23:05:52,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:52,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:52,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538040394] [2020-10-21 23:05:52,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:52,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:52,039 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 3 states. [2020-10-21 23:05:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:52,073 INFO L93 Difference]: Finished difference Result 374 states and 1066 transitions. [2020-10-21 23:05:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:52,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:05:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:52,077 INFO L225 Difference]: With dead ends: 374 [2020-10-21 23:05:52,077 INFO L226 Difference]: Without dead ends: 374 [2020-10-21 23:05:52,077 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:05:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-21 23:05:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-21 23:05:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-21 23:05:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-21 23:05:52,099 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-21 23:05:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:52,100 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-21 23:05:52,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-21 23:05:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:52,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:52,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:52,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:05:52,102 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-10-21 23:05:52,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:52,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39359242] [2020-10-21 23:05:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:52,244 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:05:52,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39359242] [2020-10-21 23:05:52,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:52,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:52,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097789563] [2020-10-21 23:05:52,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:52,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:52,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:52,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:52,249 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states. [2020-10-21 23:05:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:52,349 INFO L93 Difference]: Finished difference Result 404 states and 1154 transitions. [2020-10-21 23:05:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:52,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:05:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:52,353 INFO L225 Difference]: With dead ends: 404 [2020-10-21 23:05:52,354 INFO L226 Difference]: Without dead ends: 404 [2020-10-21 23:05:52,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-21 23:05:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2020-10-21 23:05:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-10-21 23:05:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1154 transitions. [2020-10-21 23:05:52,367 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1154 transitions. Word has length 13 [2020-10-21 23:05:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:52,367 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1154 transitions. [2020-10-21 23:05:52,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1154 transitions. [2020-10-21 23:05:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:52,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:52,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:52,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:05:52,370 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1204965012, now seen corresponding path program 1 times [2020-10-21 23:05:52,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:52,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424211748] [2020-10-21 23:05:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:52,428 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:05:52,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424211748] [2020-10-21 23:05:52,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:52,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:05:52,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051075559] [2020-10-21 23:05:52,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:52,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:52,431 INFO L87 Difference]: Start difference. First operand 404 states and 1154 transitions. Second operand 4 states. [2020-10-21 23:05:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:52,485 INFO L93 Difference]: Finished difference Result 411 states and 1176 transitions. [2020-10-21 23:05:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:52,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:05:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:52,489 INFO L225 Difference]: With dead ends: 411 [2020-10-21 23:05:52,489 INFO L226 Difference]: Without dead ends: 411 [2020-10-21 23:05:52,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-21 23:05:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-10-21 23:05:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-21 23:05:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1162 transitions. [2020-10-21 23:05:52,535 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1162 transitions. Word has length 13 [2020-10-21 23:05:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:52,535 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1162 transitions. [2020-10-21 23:05:52,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1162 transitions. [2020-10-21 23:05:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:52,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:52,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:52,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:05:52,538 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 438940752, now seen corresponding path program 2 times [2020-10-21 23:05:52,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:52,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170189760] [2020-10-21 23:05:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:52,648 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:05:52,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170189760] [2020-10-21 23:05:52,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:52,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:52,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988143075] [2020-10-21 23:05:52,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:52,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:52,651 INFO L87 Difference]: Start difference. First operand 407 states and 1162 transitions. Second operand 5 states. [2020-10-21 23:05:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:52,715 INFO L93 Difference]: Finished difference Result 402 states and 1146 transitions. [2020-10-21 23:05:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:52,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:05:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:52,719 INFO L225 Difference]: With dead ends: 402 [2020-10-21 23:05:52,719 INFO L226 Difference]: Without dead ends: 402 [2020-10-21 23:05:52,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-21 23:05:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 395. [2020-10-21 23:05:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-21 23:05:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1124 transitions. [2020-10-21 23:05:52,732 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1124 transitions. Word has length 13 [2020-10-21 23:05:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:52,733 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 1124 transitions. [2020-10-21 23:05:52,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1124 transitions. [2020-10-21 23:05:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:52,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:52,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:52,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:05:52,735 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-10-21 23:05:52,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:52,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086104008] [2020-10-21 23:05:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:52,849 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:05:52,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086104008] [2020-10-21 23:05:52,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:52,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:52,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026335686] [2020-10-21 23:05:52,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:52,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:52,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:52,852 INFO L87 Difference]: Start difference. First operand 395 states and 1124 transitions. Second operand 6 states. [2020-10-21 23:05:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:52,961 INFO L93 Difference]: Finished difference Result 391 states and 1110 transitions. [2020-10-21 23:05:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:52,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:05:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:52,966 INFO L225 Difference]: With dead ends: 391 [2020-10-21 23:05:52,967 INFO L226 Difference]: Without dead ends: 391 [2020-10-21 23:05:52,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:05:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-10-21 23:05:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 359. [2020-10-21 23:05:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-10-21 23:05:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1014 transitions. [2020-10-21 23:05:52,980 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1014 transitions. Word has length 14 [2020-10-21 23:05:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:52,980 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 1014 transitions. [2020-10-21 23:05:52,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1014 transitions. [2020-10-21 23:05:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:52,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:52,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:52,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:05:52,982 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1758150645, now seen corresponding path program 1 times [2020-10-21 23:05:52,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:52,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626848999] [2020-10-21 23:05:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:53,050 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:05:53,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626848999] [2020-10-21 23:05:53,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:53,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:53,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453179313] [2020-10-21 23:05:53,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:53,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:53,052 INFO L87 Difference]: Start difference. First operand 359 states and 1014 transitions. Second operand 5 states. [2020-10-21 23:05:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:53,147 INFO L93 Difference]: Finished difference Result 404 states and 1144 transitions. [2020-10-21 23:05:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:05:53,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:05:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:53,151 INFO L225 Difference]: With dead ends: 404 [2020-10-21 23:05:53,151 INFO L226 Difference]: Without dead ends: 404 [2020-10-21 23:05:53,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:05:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-21 23:05:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 374. [2020-10-21 23:05:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-21 23:05:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1051 transitions. [2020-10-21 23:05:53,163 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1051 transitions. Word has length 14 [2020-10-21 23:05:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:53,163 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1051 transitions. [2020-10-21 23:05:53,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1051 transitions. [2020-10-21 23:05:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:53,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:53,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:53,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:05:53,165 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 992126385, now seen corresponding path program 2 times [2020-10-21 23:05:53,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:53,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132242367] [2020-10-21 23:05:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:53,302 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:05:53,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132242367] [2020-10-21 23:05:53,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:53,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:53,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478055912] [2020-10-21 23:05:53,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:53,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:53,305 INFO L87 Difference]: Start difference. First operand 374 states and 1051 transitions. Second operand 6 states. [2020-10-21 23:05:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:53,423 INFO L93 Difference]: Finished difference Result 422 states and 1191 transitions. [2020-10-21 23:05:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:53,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:05:53,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:53,430 INFO L225 Difference]: With dead ends: 422 [2020-10-21 23:05:53,430 INFO L226 Difference]: Without dead ends: 422 [2020-10-21 23:05:53,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-21 23:05:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 398. [2020-10-21 23:05:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-21 23:05:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1133 transitions. [2020-10-21 23:05:53,443 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1133 transitions. Word has length 14 [2020-10-21 23:05:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:53,444 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1133 transitions. [2020-10-21 23:05:53,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1133 transitions. [2020-10-21 23:05:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:53,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:53,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:53,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:05:53,446 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash 722213851, now seen corresponding path program 3 times [2020-10-21 23:05:53,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:53,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899609950] [2020-10-21 23:05:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:53,600 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:05:53,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899609950] [2020-10-21 23:05:53,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:53,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:53,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21516181] [2020-10-21 23:05:53,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:53,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:53,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:53,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:53,603 INFO L87 Difference]: Start difference. First operand 398 states and 1133 transitions. Second operand 6 states. [2020-10-21 23:05:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:53,722 INFO L93 Difference]: Finished difference Result 422 states and 1207 transitions. [2020-10-21 23:05:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:53,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:05:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:53,727 INFO L225 Difference]: With dead ends: 422 [2020-10-21 23:05:53,727 INFO L226 Difference]: Without dead ends: 422 [2020-10-21 23:05:53,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-21 23:05:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 398. [2020-10-21 23:05:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-21 23:05:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1131 transitions. [2020-10-21 23:05:53,739 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1131 transitions. Word has length 14 [2020-10-21 23:05:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:53,740 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1131 transitions. [2020-10-21 23:05:53,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1131 transitions. [2020-10-21 23:05:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:53,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:53,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:53,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:05:53,742 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 722260351, now seen corresponding path program 4 times [2020-10-21 23:05:53,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:53,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411324538] [2020-10-21 23:05:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:53,833 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:05:53,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411324538] [2020-10-21 23:05:53,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:53,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:53,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68127378] [2020-10-21 23:05:53,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:53,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:53,835 INFO L87 Difference]: Start difference. First operand 398 states and 1131 transitions. Second operand 6 states. [2020-10-21 23:05:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:53,977 INFO L93 Difference]: Finished difference Result 490 states and 1402 transitions. [2020-10-21 23:05:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:53,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:05:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:53,981 INFO L225 Difference]: With dead ends: 490 [2020-10-21 23:05:53,981 INFO L226 Difference]: Without dead ends: 490 [2020-10-21 23:05:53,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:05:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-21 23:05:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 423. [2020-10-21 23:05:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-21 23:05:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1197 transitions. [2020-10-21 23:05:54,001 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1197 transitions. Word has length 14 [2020-10-21 23:05:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:54,002 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1197 transitions. [2020-10-21 23:05:54,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1197 transitions. [2020-10-21 23:05:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:54,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:54,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:54,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:05:54,004 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906856, now seen corresponding path program 1 times [2020-10-21 23:05:54,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:54,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184183714] [2020-10-21 23:05:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:54,141 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:05:54,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184183714] [2020-10-21 23:05:54,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:54,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:54,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042856012] [2020-10-21 23:05:54,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:54,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:54,143 INFO L87 Difference]: Start difference. First operand 423 states and 1197 transitions. Second operand 6 states. [2020-10-21 23:05:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:54,326 INFO L93 Difference]: Finished difference Result 492 states and 1379 transitions. [2020-10-21 23:05:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:54,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:05:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:54,331 INFO L225 Difference]: With dead ends: 492 [2020-10-21 23:05:54,331 INFO L226 Difference]: Without dead ends: 492 [2020-10-21 23:05:54,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:05:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-21 23:05:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 407. [2020-10-21 23:05:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-21 23:05:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1145 transitions. [2020-10-21 23:05:54,346 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1145 transitions. Word has length 15 [2020-10-21 23:05:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:54,347 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1145 transitions. [2020-10-21 23:05:54,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1145 transitions. [2020-10-21 23:05:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:54,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:54,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:54,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:05:54,349 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-10-21 23:05:54,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:54,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123881152] [2020-10-21 23:05:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:54,492 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:05:54,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123881152] [2020-10-21 23:05:54,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:54,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:54,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416975670] [2020-10-21 23:05:54,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:54,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:54,495 INFO L87 Difference]: Start difference. First operand 407 states and 1145 transitions. Second operand 6 states. [2020-10-21 23:05:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:54,670 INFO L93 Difference]: Finished difference Result 566 states and 1550 transitions. [2020-10-21 23:05:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:05:54,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:05:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:54,675 INFO L225 Difference]: With dead ends: 566 [2020-10-21 23:05:54,675 INFO L226 Difference]: Without dead ends: 554 [2020-10-21 23:05:54,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:05:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-10-21 23:05:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 426. [2020-10-21 23:05:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-21 23:05:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1188 transitions. [2020-10-21 23:05:54,689 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1188 transitions. Word has length 15 [2020-10-21 23:05:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:54,689 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1188 transitions. [2020-10-21 23:05:54,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1188 transitions. [2020-10-21 23:05:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:54,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:54,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:54,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:05:54,691 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-10-21 23:05:54,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:54,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477176649] [2020-10-21 23:05:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:54,736 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:05:54,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477176649] [2020-10-21 23:05:54,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:54,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:54,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515413105] [2020-10-21 23:05:54,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:54,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:54,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:54,738 INFO L87 Difference]: Start difference. First operand 426 states and 1188 transitions. Second operand 5 states. [2020-10-21 23:05:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:54,800 INFO L93 Difference]: Finished difference Result 645 states and 1759 transitions. [2020-10-21 23:05:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:54,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:05:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:54,803 INFO L225 Difference]: With dead ends: 645 [2020-10-21 23:05:54,804 INFO L226 Difference]: Without dead ends: 382 [2020-10-21 23:05:54,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-10-21 23:05:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2020-10-21 23:05:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-10-21 23:05:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 936 transitions. [2020-10-21 23:05:54,814 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 936 transitions. Word has length 15 [2020-10-21 23:05:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:54,815 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 936 transitions. [2020-10-21 23:05:54,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 936 transitions. [2020-10-21 23:05:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:54,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:54,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:05:54,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:05:54,816 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-10-21 23:05:54,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:54,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166755029] [2020-10-21 23:05:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:54,862 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:05:54,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166755029] [2020-10-21 23:05:54,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:54,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:54,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432913095] [2020-10-21 23:05:54,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:54,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:54,864 INFO L87 Difference]: Start difference. First operand 364 states and 936 transitions. Second operand 4 states. [2020-10-21 23:05:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:54,895 INFO L93 Difference]: Finished difference Result 350 states and 811 transitions. [2020-10-21 23:05:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:54,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 23:05:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:54,897 INFO L225 Difference]: With dead ends: 350 [2020-10-21 23:05:54,898 INFO L226 Difference]: Without dead ends: 265 [2020-10-21 23:05:54,898 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:05:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-10-21 23:05:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2020-10-21 23:05:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-10-21 23:05:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 602 transitions. [2020-10-21 23:05:54,905 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 602 transitions. Word has length 15 [2020-10-21 23:05:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:54,906 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 602 transitions. [2020-10-21 23:05:54,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 602 transitions. [2020-10-21 23:05:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:05:54,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:54,907 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:05:54,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:05:54,907 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 240713826, now seen corresponding path program 1 times [2020-10-21 23:05:54,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:54,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361807835] [2020-10-21 23:05:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:55,014 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:05:55,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361807835] [2020-10-21 23:05:55,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:55,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:05:55,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451629781] [2020-10-21 23:05:55,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:05:55,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:05:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:05:55,016 INFO L87 Difference]: Start difference. First operand 265 states and 602 transitions. Second operand 7 states. [2020-10-21 23:05:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:55,201 INFO L93 Difference]: Finished difference Result 373 states and 805 transitions. [2020-10-21 23:05:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:55,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 23:05:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:55,204 INFO L225 Difference]: With dead ends: 373 [2020-10-21 23:05:55,204 INFO L226 Difference]: Without dead ends: 275 [2020-10-21 23:05:55,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:05:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-21 23:05:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2020-10-21 23:05:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-21 23:05:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 580 transitions. [2020-10-21 23:05:55,212 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 580 transitions. Word has length 16 [2020-10-21 23:05:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:55,212 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 580 transitions. [2020-10-21 23:05:55,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:05:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 580 transitions. [2020-10-21 23:05:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:05:55,213 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:55,213 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:05:55,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:05:55,214 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1927467217, now seen corresponding path program 1 times [2020-10-21 23:05:55,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:55,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074819386] [2020-10-21 23:05:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:55,270 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:05:55,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074819386] [2020-10-21 23:05:55,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:55,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:55,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460842187] [2020-10-21 23:05:55,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:55,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:55,272 INFO L87 Difference]: Start difference. First operand 257 states and 580 transitions. Second operand 5 states. [2020-10-21 23:05:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:55,311 INFO L93 Difference]: Finished difference Result 221 states and 451 transitions. [2020-10-21 23:05:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:05:55,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:05:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:55,313 INFO L225 Difference]: With dead ends: 221 [2020-10-21 23:05:55,313 INFO L226 Difference]: Without dead ends: 174 [2020-10-21 23:05:55,313 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:05:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-21 23:05:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-21 23:05:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-21 23:05:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 347 transitions. [2020-10-21 23:05:55,318 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 347 transitions. Word has length 16 [2020-10-21 23:05:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:55,319 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 347 transitions. [2020-10-21 23:05:55,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 347 transitions. [2020-10-21 23:05:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:05:55,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:55,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:55,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:05:55,321 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 1 times [2020-10-21 23:05:55,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:55,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450245687] [2020-10-21 23:05:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:55,456 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:05:55,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450245687] [2020-10-21 23:05:55,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:55,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:05:55,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234195447] [2020-10-21 23:05:55,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:05:55,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:05:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:05:55,458 INFO L87 Difference]: Start difference. First operand 174 states and 347 transitions. Second operand 7 states. [2020-10-21 23:05:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:55,626 INFO L93 Difference]: Finished difference Result 191 states and 371 transitions. [2020-10-21 23:05:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:55,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-21 23:05:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:55,628 INFO L225 Difference]: With dead ends: 191 [2020-10-21 23:05:55,628 INFO L226 Difference]: Without dead ends: 135 [2020-10-21 23:05:55,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:05:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-21 23:05:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-10-21 23:05:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-21 23:05:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-10-21 23:05:55,633 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-10-21 23:05:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:55,633 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-10-21 23:05:55,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:05:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-10-21 23:05:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:05:55,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:55,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:55,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:05:55,635 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-10-21 23:05:55,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:55,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141918089] [2020-10-21 23:05:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:55,716 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:05:55,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141918089] [2020-10-21 23:05:55,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:55,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:05:55,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086377772] [2020-10-21 23:05:55,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:55,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:55,719 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 6 states. [2020-10-21 23:05:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:55,781 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-10-21 23:05:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:55,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:05:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:55,782 INFO L225 Difference]: With dead ends: 111 [2020-10-21 23:05:55,782 INFO L226 Difference]: Without dead ends: 62 [2020-10-21 23:05:55,783 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:05:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-21 23:05:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-21 23:05:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-21 23:05:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-21 23:05:55,785 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-21 23:05:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:55,786 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-21 23:05:55,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-21 23:05:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:05:55,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:55,787 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] [2020-10-21 23:05:55,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:05:55,787 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-10-21 23:05:55,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:55,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465886823] [2020-10-21 23:05:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:05:55,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:05:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:05:55,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:05:55,925 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:05:55,925 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:05:55,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:05:55,927 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:05:55,944 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L2-->L834: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In-1879906295 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In-1879906295 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-1879906295 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-1879906295 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (not .cse6)) (.cse4 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In-1879906295 ~z$r_buff1_thd0~0_Out-1879906295) (or (and (= ~z$w_buff0~0_In-1879906295 ~z~0_Out-1879906295) .cse0 .cse1) (and (or (and .cse2 (= ~z$w_buff1~0_In-1879906295 ~z~0_Out-1879906295) .cse3) (and (= ~z~0_In-1879906295 ~z~0_Out-1879906295) .cse4)) .cse5)) (= ~z$r_buff0_thd0~0_Out-1879906295 ~z$r_buff0_thd0~0_In-1879906295) (or (and .cse5 (= ~z$w_buff0_used~0_In-1879906295 ~z$w_buff0_used~0_Out-1879906295)) (and .cse0 (= 0 ~z$w_buff0_used~0_Out-1879906295) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1879906295 0)) (or (and .cse2 (= ~z$w_buff1_used~0_Out-1879906295 0) .cse3) (and (= ~z$w_buff1_used~0_Out-1879906295 ~z$w_buff1_used~0_In-1879906295) .cse4)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1879906295| ULTIMATE.start_assume_abort_if_not_~cond_Out-1879906295)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1879906295|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1879906295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879906295, ~z$w_buff0~0=~z$w_buff0~0_In-1879906295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1879906295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1879906295, ~z$w_buff1~0=~z$w_buff1~0_In-1879906295, ~z~0=~z~0_In-1879906295} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1879906295|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1879906295, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1879906295|, ~z$w_buff0~0=~z$w_buff0~0_In-1879906295, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1879906295, ~z$w_buff1~0=~z$w_buff1~0_In-1879906295, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1879906295|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1879906295|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1879906295|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1879906295|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1879906295, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1879906295|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1879906295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1879906295, ~z~0=~z~0_Out-1879906295} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2020-10-21 23:05:55,949 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:05:55,949 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-21 23:05:55,952 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:05:55,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,953 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:05:55,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,953 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:05:55,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,953 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:05:55,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,954 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:05:55,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,954 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:05:55,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,955 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:05:55,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,956 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:05:55,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,956 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:05:55,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,956 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:05:55,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,957 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:05:55,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,957 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:05:55,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,958 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:05:55,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,958 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:05:55,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,959 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:05:55,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,959 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:05:55,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,959 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:05:55,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,960 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:05:55,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,960 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:05:55,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,961 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:05:55,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,961 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:05:55,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,962 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:05:55,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,962 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:05:55,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,962 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:05:55,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,963 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:05:55,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:55,963 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:05:55,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:56,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:05:56 BasicIcfg [2020-10-21 23:05:56,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:05:56,052 INFO L168 Benchmark]: Toolchain (without parser) took 15827.20 ms. Allocated memory was 138.4 MB in the beginning and 382.7 MB in the end (delta: 244.3 MB). Free memory was 99.7 MB in the beginning and 111.8 MB in the end (delta: -12.1 MB). Peak memory consumption was 232.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,053 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.42 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 152.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 148.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,055 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,060 INFO L168 Benchmark]: RCFGBuilder took 2247.20 ms. Allocated memory was 201.9 MB in the beginning and 252.7 MB in the end (delta: 50.9 MB). Free memory was 146.6 MB in the beginning and 166.7 MB in the end (delta: -20.1 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,061 INFO L168 Benchmark]: TraceAbstraction took 12655.44 ms. Allocated memory was 252.7 MB in the beginning and 382.7 MB in the end (delta: 130.0 MB). Free memory was 164.7 MB in the beginning and 111.8 MB in the end (delta: 53.0 MB). Peak memory consumption was 183.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:56,068 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.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.42 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 152.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 148.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2247.20 ms. Allocated memory was 201.9 MB in the beginning and 252.7 MB in the end (delta: 50.9 MB). Free memory was 146.6 MB in the beginning and 166.7 MB in the end (delta: -20.1 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12655.44 ms. Allocated memory was 252.7 MB in the beginning and 382.7 MB in the end (delta: 130.0 MB). Free memory was 164.7 MB in the beginning and 111.8 MB in the end (delta: 53.0 MB). Peak memory consumption was 183.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1029 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.0s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4956 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2040; [L819] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2041; [L821] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2042; [L823] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 444 SDtfs, 603 SDslu, 796 SDs, 0 SdLazy, 574 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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, 22 MinimizatonAttempts, 448 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 32451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...