/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 07:43:54,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 07:43:54,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 07:43:54,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 07:43:54,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 07:43:54,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 07:43:54,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 07:43:54,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 07:43:54,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 07:43:54,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 07:43:54,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 07:43:54,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 07:43:54,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 07:43:54,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 07:43:54,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 07:43:54,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 07:43:54,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 07:43:54,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 07:43:54,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 07:43:54,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 07:43:54,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 07:43:54,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 07:43:54,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 07:43:54,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 07:43:54,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 07:43:54,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 07:43:54,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 07:43:54,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 07:43:54,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 07:43:54,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 07:43:54,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 07:43:54,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 07:43:54,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 07:43:54,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 07:43:54,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 07:43:54,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 07:43:54,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 07:43:54,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 07:43:54,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 07:43:54,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 07:43:54,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 07:43:54,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 07:43:54,437 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 07:43:54,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 07:43:54,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 07:43:54,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 07:43:54,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 07:43:54,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 07:43:54,439 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 07:43:54,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 07:43:54,440 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 07:43:54,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 07:43:54,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 07:43:54,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 07:43:54,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 07:43:54,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 07:43:54,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 07:43:54,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 07:43:54,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 07:43:54,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 07:43:54,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 07:43:54,689 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 07:43:54,689 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 07:43:54,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-06-05 07:43:54,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa420a2bc/fb3be318838d46b4a959b1308bab007d/FLAGc8a0cba48 [2021-06-05 07:43:55,224 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 07:43:55,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-06-05 07:43:55,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa420a2bc/fb3be318838d46b4a959b1308bab007d/FLAGc8a0cba48 [2021-06-05 07:43:55,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa420a2bc/fb3be318838d46b4a959b1308bab007d [2021-06-05 07:43:55,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 07:43:55,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 07:43:55,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:55,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 07:43:55,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 07:43:55,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3396ac69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55, skipping insertion in model container [2021-06-05 07:43:55,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 07:43:55,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 07:43:55,492 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 07:43:55,648 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-06-05 07:43:55,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:55,661 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 07:43:55,675 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 07:43:55,686 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-06-05 07:43:55,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 07:43:55,809 INFO L208 MainTranslator]: Completed translation [2021-06-05 07:43:55,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55 WrapperNode [2021-06-05 07:43:55,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 07:43:55,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:55,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 07:43:55,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 07:43:55,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 07:43:55,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 07:43:55,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 07:43:55,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 07:43:55,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (1/1) ... [2021-06-05 07:43:55,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 07:43:55,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 07:43:55,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 07:43:55,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 07:43:55,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (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 [2021-06-05 07:43:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 07:43:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 07:43:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 07:43:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-06-05 07:43:55,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 07:43:55,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 07:43:55,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 07:43:55,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-05 07:43:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 07:43:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 07:43:55,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 07:43:55,928 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 07:43:56,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 07:43:56,176 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-05 07:43:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:56 BoogieIcfgContainer [2021-06-05 07:43:56,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 07:43:56,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 07:43:56,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 07:43:56,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 07:43:56,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 07:43:55" (1/3) ... [2021-06-05 07:43:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0cd26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:56, skipping insertion in model container [2021-06-05 07:43:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 07:43:55" (2/3) ... [2021-06-05 07:43:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0cd26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 07:43:56, skipping insertion in model container [2021-06-05 07:43:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 07:43:56" (3/3) ... [2021-06-05 07:43:56,182 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-06-05 07:43:56,185 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 07:43:56,185 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 07:43:56,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 07:43:56,186 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,250 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,252 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,257 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,258 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,259 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,260 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,263 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,263 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,264 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,264 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,264 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,265 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,267 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,267 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,267 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,267 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,268 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,269 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,270 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,271 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,271 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,272 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,274 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,274 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,275 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,275 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,275 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,275 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,276 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,276 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,277 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,277 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,277 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,277 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 07:43:56,379 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-06-05 07:43:56,393 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 07:43:56,403 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 07:43:56,403 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 07:43:56,404 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 07:43:56,404 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 07:43:56,404 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 07:43:56,404 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 07:43:56,404 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 07:43:56,404 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 07:43:56,416 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-06-05 07:44:01,431 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 07:44:01,551 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:01,552 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:01,552 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -811265628, now seen corresponding path program 1 times [2021-06-05 07:44:01,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:01,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096944085] [2021-06-05 07:44:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:02,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:02,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096944085] [2021-06-05 07:44:02,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096944085] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:02,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:02,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:44:02,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975610267] [2021-06-05 07:44:02,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:44:02,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:44:02,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:44:02,195 INFO L87 Difference]: Start difference. First operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:03,587 INFO L93 Difference]: Finished difference Result 76010 states and 329094 transitions. [2021-06-05 07:44:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:44:03,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 07:44:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:04,042 INFO L225 Difference]: With dead ends: 76010 [2021-06-05 07:44:04,042 INFO L226 Difference]: Without dead ends: 54772 [2021-06-05 07:44:04,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 297.0ms TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:44:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54772 states. [2021-06-05 07:44:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54772 to 46283. [2021-06-05 07:44:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46283 states, 46280 states have (on average 4.362337942955921) internal successors, (201889), 46282 states have internal predecessors, (201889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 201889 transitions. [2021-06-05 07:44:05,959 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 201889 transitions. Word has length 41 [2021-06-05 07:44:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:05,961 INFO L482 AbstractCegarLoop]: Abstraction has 46283 states and 201889 transitions. [2021-06-05 07:44:05,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 201889 transitions. [2021-06-05 07:44:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 07:44:05,964 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:05,964 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:05,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 07:44:05,964 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash -589683484, now seen corresponding path program 2 times [2021-06-05 07:44:05,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:05,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534625331] [2021-06-05 07:44:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:06,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:06,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534625331] [2021-06-05 07:44:06,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534625331] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:06,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:06,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:44:06,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229855496] [2021-06-05 07:44:06,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:44:06,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:44:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:44:06,223 INFO L87 Difference]: Start difference. First operand 46283 states and 201889 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:07,368 INFO L93 Difference]: Finished difference Result 54799 states and 241924 transitions. [2021-06-05 07:44:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 07:44:07,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 07:44:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:07,580 INFO L225 Difference]: With dead ends: 54799 [2021-06-05 07:44:07,580 INFO L226 Difference]: Without dead ends: 54799 [2021-06-05 07:44:07,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 326.1ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:44:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54799 states. [2021-06-05 07:44:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54799 to 46286. [2021-06-05 07:44:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46286 states, 46283 states have (on average 4.362120000864248) internal successors, (201892), 46285 states have internal predecessors, (201892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46286 states to 46286 states and 201892 transitions. [2021-06-05 07:44:09,010 INFO L78 Accepts]: Start accepts. Automaton has 46286 states and 201892 transitions. Word has length 41 [2021-06-05 07:44:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:09,012 INFO L482 AbstractCegarLoop]: Abstraction has 46286 states and 201892 transitions. [2021-06-05 07:44:09,013 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46286 states and 201892 transitions. [2021-06-05 07:44:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 07:44:09,016 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:09,017 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:09,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 07:44:09,017 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 325896192, now seen corresponding path program 3 times [2021-06-05 07:44:09,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:09,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118458420] [2021-06-05 07:44:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:09,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:09,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118458420] [2021-06-05 07:44:09,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118458420] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:09,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:09,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 07:44:09,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566151863] [2021-06-05 07:44:09,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 07:44:09,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:09,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 07:44:09,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 07:44:09,248 INFO L87 Difference]: Start difference. First operand 46286 states and 201892 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:10,011 INFO L93 Difference]: Finished difference Result 54743 states and 241824 transitions. [2021-06-05 07:44:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 07:44:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 07:44:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:10,175 INFO L225 Difference]: With dead ends: 54743 [2021-06-05 07:44:10,176 INFO L226 Difference]: Without dead ends: 54743 [2021-06-05 07:44:10,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 170.6ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:44:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2021-06-05 07:44:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 46227. [2021-06-05 07:44:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46227 states, 46225 states have (on average 4.365365062195782) internal successors, (201789), 46226 states have internal predecessors, (201789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46227 states to 46227 states and 201789 transitions. [2021-06-05 07:44:11,803 INFO L78 Accepts]: Start accepts. Automaton has 46227 states and 201789 transitions. Word has length 41 [2021-06-05 07:44:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:11,803 INFO L482 AbstractCegarLoop]: Abstraction has 46227 states and 201789 transitions. [2021-06-05 07:44:11,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 46227 states and 201789 transitions. [2021-06-05 07:44:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 07:44:11,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:11,823 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:11,823 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 07:44:11,823 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2119961237, now seen corresponding path program 1 times [2021-06-05 07:44:11,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:11,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279336839] [2021-06-05 07:44:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:11,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:11,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279336839] [2021-06-05 07:44:11,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279336839] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:11,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:11,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 07:44:11,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107888271] [2021-06-05 07:44:11,935 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 07:44:11,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 07:44:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 07:44:11,936 INFO L87 Difference]: Start difference. First operand 46227 states and 201789 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:12,528 INFO L93 Difference]: Finished difference Result 96773 states and 411557 transitions. [2021-06-05 07:44:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 07:44:12,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 07:44:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:13,080 INFO L225 Difference]: With dead ends: 96773 [2021-06-05 07:44:13,081 INFO L226 Difference]: Without dead ends: 61407 [2021-06-05 07:44:13,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:44:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2021-06-05 07:44:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 49089. [2021-06-05 07:44:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49089 states, 49087 states have (on average 4.207203536577913) internal successors, (206519), 49088 states have internal predecessors, (206519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 206519 transitions. [2021-06-05 07:44:14,323 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 206519 transitions. Word has length 54 [2021-06-05 07:44:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:14,324 INFO L482 AbstractCegarLoop]: Abstraction has 49089 states and 206519 transitions. [2021-06-05 07:44:14,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 206519 transitions. [2021-06-05 07:44:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 07:44:14,331 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:14,331 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:14,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 07:44:14,331 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash 319566966, now seen corresponding path program 1 times [2021-06-05 07:44:14,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:14,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774195751] [2021-06-05 07:44:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:14,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:14,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774195751] [2021-06-05 07:44:14,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774195751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:14,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:14,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 07:44:14,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105937525] [2021-06-05 07:44:14,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 07:44:14,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:14,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 07:44:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 07:44:14,406 INFO L87 Difference]: Start difference. First operand 49089 states and 206519 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:15,310 INFO L93 Difference]: Finished difference Result 67425 states and 276590 transitions. [2021-06-05 07:44:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 07:44:15,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 07:44:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:15,473 INFO L225 Difference]: With dead ends: 67425 [2021-06-05 07:44:15,473 INFO L226 Difference]: Without dead ends: 61341 [2021-06-05 07:44:15,474 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 121.5ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:44:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61341 states. [2021-06-05 07:44:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61341 to 48869. [2021-06-05 07:44:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48869 states, 48867 states have (on average 4.211697055272475) internal successors, (205813), 48868 states have internal predecessors, (205813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48869 states to 48869 states and 205813 transitions. [2021-06-05 07:44:17,296 INFO L78 Accepts]: Start accepts. Automaton has 48869 states and 205813 transitions. Word has length 59 [2021-06-05 07:44:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:17,297 INFO L482 AbstractCegarLoop]: Abstraction has 48869 states and 205813 transitions. [2021-06-05 07:44:17,297 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48869 states and 205813 transitions. [2021-06-05 07:44:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 07:44:17,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:17,338 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:17,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 07:44:17,338 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1864004856, now seen corresponding path program 1 times [2021-06-05 07:44:17,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:17,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839373459] [2021-06-05 07:44:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:17,822 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:17,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839373459] [2021-06-05 07:44:17,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839373459] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:17,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:17,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:44:17,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579893734] [2021-06-05 07:44:17,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:44:17,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:17,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:44:17,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:44:17,823 INFO L87 Difference]: Start difference. First operand 48869 states and 205813 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:19,440 INFO L93 Difference]: Finished difference Result 57826 states and 244284 transitions. [2021-06-05 07:44:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 07:44:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 07:44:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:19,610 INFO L225 Difference]: With dead ends: 57826 [2021-06-05 07:44:19,610 INFO L226 Difference]: Without dead ends: 57556 [2021-06-05 07:44:19,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 782.8ms TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 07:44:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57556 states. [2021-06-05 07:44:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57556 to 54249. [2021-06-05 07:44:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54249 states, 54247 states have (on average 4.2520139362545395) internal successors, (230659), 54248 states have internal predecessors, (230659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54249 states to 54249 states and 230659 transitions. [2021-06-05 07:44:20,871 INFO L78 Accepts]: Start accepts. Automaton has 54249 states and 230659 transitions. Word has length 60 [2021-06-05 07:44:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:20,872 INFO L482 AbstractCegarLoop]: Abstraction has 54249 states and 230659 transitions. [2021-06-05 07:44:20,872 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 54249 states and 230659 transitions. [2021-06-05 07:44:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 07:44:20,880 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:20,880 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:20,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 07:44:20,881 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1211952212, now seen corresponding path program 2 times [2021-06-05 07:44:20,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:20,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326230352] [2021-06-05 07:44:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:21,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:21,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326230352] [2021-06-05 07:44:21,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326230352] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:21,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:21,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 07:44:21,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137995017] [2021-06-05 07:44:21,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 07:44:21,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 07:44:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 07:44:21,224 INFO L87 Difference]: Start difference. First operand 54249 states and 230659 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:22,893 INFO L93 Difference]: Finished difference Result 63262 states and 269281 transitions. [2021-06-05 07:44:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:44:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 07:44:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:23,078 INFO L225 Difference]: With dead ends: 63262 [2021-06-05 07:44:23,078 INFO L226 Difference]: Without dead ends: 62992 [2021-06-05 07:44:23,079 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 602.5ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 07:44:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62992 states. [2021-06-05 07:44:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62992 to 54264. [2021-06-05 07:44:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54264 states, 54262 states have (on average 4.2514466846043275) internal successors, (230692), 54263 states have internal predecessors, (230692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54264 states to 54264 states and 230692 transitions. [2021-06-05 07:44:24,828 INFO L78 Accepts]: Start accepts. Automaton has 54264 states and 230692 transitions. Word has length 60 [2021-06-05 07:44:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:24,828 INFO L482 AbstractCegarLoop]: Abstraction has 54264 states and 230692 transitions. [2021-06-05 07:44:24,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54264 states and 230692 transitions. [2021-06-05 07:44:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 07:44:24,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:24,836 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:24,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 07:44:24,836 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1520073798, now seen corresponding path program 3 times [2021-06-05 07:44:24,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:24,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794853109] [2021-06-05 07:44:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:25,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:25,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794853109] [2021-06-05 07:44:25,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794853109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:25,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:25,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:44:25,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115127486] [2021-06-05 07:44:25,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:44:25,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:44:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:44:25,116 INFO L87 Difference]: Start difference. First operand 54264 states and 230692 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:26,406 INFO L93 Difference]: Finished difference Result 63260 states and 269245 transitions. [2021-06-05 07:44:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:44:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 07:44:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:26,636 INFO L225 Difference]: With dead ends: 63260 [2021-06-05 07:44:26,636 INFO L226 Difference]: Without dead ends: 62990 [2021-06-05 07:44:26,637 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 435.4ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:44:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62990 states. [2021-06-05 07:44:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62990 to 54281. [2021-06-05 07:44:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54281 states, 54279 states have (on average 4.250759962416404) internal successors, (230727), 54280 states have internal predecessors, (230727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 230727 transitions. [2021-06-05 07:44:28,070 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 230727 transitions. Word has length 60 [2021-06-05 07:44:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:28,071 INFO L482 AbstractCegarLoop]: Abstraction has 54281 states and 230727 transitions. [2021-06-05 07:44:28,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 230727 transitions. [2021-06-05 07:44:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 07:44:28,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:28,079 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:28,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 07:44:28,079 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -181639794, now seen corresponding path program 4 times [2021-06-05 07:44:28,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:28,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947058022] [2021-06-05 07:44:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:28,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:28,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947058022] [2021-06-05 07:44:28,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947058022] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:28,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:28,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 07:44:28,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727454215] [2021-06-05 07:44:28,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 07:44:28,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 07:44:28,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:44:28,335 INFO L87 Difference]: Start difference. First operand 54281 states and 230727 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:29,496 INFO L93 Difference]: Finished difference Result 63305 states and 269323 transitions. [2021-06-05 07:44:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 07:44:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 07:44:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:29,669 INFO L225 Difference]: With dead ends: 63305 [2021-06-05 07:44:29,669 INFO L226 Difference]: Without dead ends: 63035 [2021-06-05 07:44:29,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 361.2ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:44:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63035 states. [2021-06-05 07:44:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63035 to 54310. [2021-06-05 07:44:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54310 states, 54308 states have (on average 4.249318700743905) internal successors, (230772), 54309 states have internal predecessors, (230772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54310 states to 54310 states and 230772 transitions. [2021-06-05 07:44:31,093 INFO L78 Accepts]: Start accepts. Automaton has 54310 states and 230772 transitions. Word has length 60 [2021-06-05 07:44:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:31,093 INFO L482 AbstractCegarLoop]: Abstraction has 54310 states and 230772 transitions. [2021-06-05 07:44:31,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54310 states and 230772 transitions. [2021-06-05 07:44:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 07:44:31,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:31,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:31,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 07:44:31,101 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash -994232682, now seen corresponding path program 5 times [2021-06-05 07:44:31,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:31,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485506582] [2021-06-05 07:44:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:31,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:31,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485506582] [2021-06-05 07:44:31,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485506582] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:31,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:31,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 07:44:31,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415190795] [2021-06-05 07:44:31,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 07:44:31,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 07:44:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-06-05 07:44:31,302 INFO L87 Difference]: Start difference. First operand 54310 states and 230772 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:32,264 INFO L93 Difference]: Finished difference Result 63086 states and 268677 transitions. [2021-06-05 07:44:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:44:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 07:44:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:32,430 INFO L225 Difference]: With dead ends: 63086 [2021-06-05 07:44:32,430 INFO L226 Difference]: Without dead ends: 62816 [2021-06-05 07:44:32,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 210.7ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:44:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2021-06-05 07:44:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 54062. [2021-06-05 07:44:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54062 states, 54060 states have (on average 4.256030336662967) internal successors, (230081), 54061 states have internal predecessors, (230081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54062 states to 54062 states and 230081 transitions. [2021-06-05 07:44:34,039 INFO L78 Accepts]: Start accepts. Automaton has 54062 states and 230081 transitions. Word has length 60 [2021-06-05 07:44:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:34,039 INFO L482 AbstractCegarLoop]: Abstraction has 54062 states and 230081 transitions. [2021-06-05 07:44:34,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 54062 states and 230081 transitions. [2021-06-05 07:44:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:34,051 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:34,051 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:34,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 07:44:34,051 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash -114684342, now seen corresponding path program 1 times [2021-06-05 07:44:34,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:34,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088720052] [2021-06-05 07:44:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:34,732 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 07:44:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:34,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:34,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088720052] [2021-06-05 07:44:34,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088720052] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:34,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:34,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:44:34,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873440294] [2021-06-05 07:44:34,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:44:34,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:44:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:44:34,817 INFO L87 Difference]: Start difference. First operand 54062 states and 230081 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:36,120 INFO L93 Difference]: Finished difference Result 65701 states and 278957 transitions. [2021-06-05 07:44:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:44:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:36,295 INFO L225 Difference]: With dead ends: 65701 [2021-06-05 07:44:36,295 INFO L226 Difference]: Without dead ends: 65359 [2021-06-05 07:44:36,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1116.0ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 07:44:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65359 states. [2021-06-05 07:44:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65359 to 60588. [2021-06-05 07:44:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-05 07:44:38,050 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-05 07:44:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:38,050 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-05 07:44:38,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-05 07:44:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:38,063 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:38,063 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:38,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 07:44:38,063 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1301917267, now seen corresponding path program 1 times [2021-06-05 07:44:38,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:38,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039629253] [2021-06-05 07:44:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:38,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:38,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039629253] [2021-06-05 07:44:38,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039629253] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:38,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:38,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:44:38,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570578812] [2021-06-05 07:44:38,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:44:38,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:44:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:44:38,515 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:40,153 INFO L93 Difference]: Finished difference Result 71076 states and 302873 transitions. [2021-06-05 07:44:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:44:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:40,361 INFO L225 Difference]: With dead ends: 71076 [2021-06-05 07:44:40,361 INFO L226 Difference]: Without dead ends: 70734 [2021-06-05 07:44:40,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 800.8ms TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 07:44:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70734 states. [2021-06-05 07:44:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70734 to 60588. [2021-06-05 07:44:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-05 07:44:41,859 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-05 07:44:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:41,859 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-05 07:44:41,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-05 07:44:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:41,872 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:41,872 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:41,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 07:44:41,873 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1765911259, now seen corresponding path program 2 times [2021-06-05 07:44:41,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:41,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745808637] [2021-06-05 07:44:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:42,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:42,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745808637] [2021-06-05 07:44:42,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745808637] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:42,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:42,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:44:42,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33377051] [2021-06-05 07:44:42,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:44:42,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:44:42,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:44:42,582 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:43,741 INFO L93 Difference]: Finished difference Result 73658 states and 314685 transitions. [2021-06-05 07:44:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:44:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:43,941 INFO L225 Difference]: With dead ends: 73658 [2021-06-05 07:44:43,941 INFO L226 Difference]: Without dead ends: 73316 [2021-06-05 07:44:43,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 939.9ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-06-05 07:44:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2021-06-05 07:44:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 57618. [2021-06-05 07:44:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57618 states, 57616 states have (on average 4.267998472646487) internal successors, (245905), 57617 states have internal predecessors, (245905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 245905 transitions. [2021-06-05 07:44:45,763 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 245905 transitions. Word has length 62 [2021-06-05 07:44:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:45,764 INFO L482 AbstractCegarLoop]: Abstraction has 57618 states and 245905 transitions. [2021-06-05 07:44:45,764 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 245905 transitions. [2021-06-05 07:44:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:45,777 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:45,777 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:45,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 07:44:45,777 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1261621970, now seen corresponding path program 2 times [2021-06-05 07:44:45,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:45,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833315248] [2021-06-05 07:44:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:46,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:46,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833315248] [2021-06-05 07:44:46,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833315248] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:46,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:46,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:44:46,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679614623] [2021-06-05 07:44:46,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:44:46,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:44:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:44:46,009 INFO L87 Difference]: Start difference. First operand 57618 states and 245905 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:47,266 INFO L93 Difference]: Finished difference Result 65381 states and 277424 transitions. [2021-06-05 07:44:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 07:44:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:47,468 INFO L225 Difference]: With dead ends: 65381 [2021-06-05 07:44:47,468 INFO L226 Difference]: Without dead ends: 65039 [2021-06-05 07:44:47,469 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 396.8ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:44:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65039 states. [2021-06-05 07:44:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65039 to 57621. [2021-06-05 07:44:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57621 states, 57619 states have (on average 4.267828320519273) internal successors, (245908), 57620 states have internal predecessors, (245908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57621 states to 57621 states and 245908 transitions. [2021-06-05 07:44:48,933 INFO L78 Accepts]: Start accepts. Automaton has 57621 states and 245908 transitions. Word has length 62 [2021-06-05 07:44:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:48,933 INFO L482 AbstractCegarLoop]: Abstraction has 57621 states and 245908 transitions. [2021-06-05 07:44:48,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57621 states and 245908 transitions. [2021-06-05 07:44:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:48,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:48,946 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:48,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 07:44:48,946 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1971465376, now seen corresponding path program 3 times [2021-06-05 07:44:48,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:48,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513460389] [2021-06-05 07:44:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:49,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:49,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513460389] [2021-06-05 07:44:49,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513460389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:49,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:49,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:44:49,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329782354] [2021-06-05 07:44:49,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:44:49,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:44:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:44:49,137 INFO L87 Difference]: Start difference. First operand 57621 states and 245908 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:50,249 INFO L93 Difference]: Finished difference Result 65409 states and 277466 transitions. [2021-06-05 07:44:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 07:44:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:50,453 INFO L225 Difference]: With dead ends: 65409 [2021-06-05 07:44:50,453 INFO L226 Difference]: Without dead ends: 65067 [2021-06-05 07:44:50,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 299.8ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:44:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65067 states. [2021-06-05 07:44:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65067 to 57649. [2021-06-05 07:44:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57649 states, 57647 states have (on average 4.266518639304734) internal successors, (245952), 57648 states have internal predecessors, (245952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57649 states to 57649 states and 245952 transitions. [2021-06-05 07:44:51,961 INFO L78 Accepts]: Start accepts. Automaton has 57649 states and 245952 transitions. Word has length 62 [2021-06-05 07:44:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:51,962 INFO L482 AbstractCegarLoop]: Abstraction has 57649 states and 245952 transitions. [2021-06-05 07:44:51,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 57649 states and 245952 transitions. [2021-06-05 07:44:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 07:44:51,974 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:51,974 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:51,974 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 07:44:51,974 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:51,975 INFO L82 PathProgramCache]: Analyzing trace with hash 116713492, now seen corresponding path program 4 times [2021-06-05 07:44:51,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:51,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370687034] [2021-06-05 07:44:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:52,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:52,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370687034] [2021-06-05 07:44:52,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370687034] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:52,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:52,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 07:44:52,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234509894] [2021-06-05 07:44:52,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 07:44:52,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 07:44:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-06-05 07:44:52,136 INFO L87 Difference]: Start difference. First operand 57649 states and 245952 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:53,083 INFO L93 Difference]: Finished difference Result 60948 states and 256662 transitions. [2021-06-05 07:44:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 07:44:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 07:44:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:53,272 INFO L225 Difference]: With dead ends: 60948 [2021-06-05 07:44:53,272 INFO L226 Difference]: Without dead ends: 60606 [2021-06-05 07:44:53,272 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 186.2ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 07:44:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60606 states. [2021-06-05 07:44:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60606 to 53160. [2021-06-05 07:44:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53160 states, 53158 states have (on average 4.234621317581549) internal successors, (225104), 53159 states have internal predecessors, (225104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 225104 transitions. [2021-06-05 07:44:54,696 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 225104 transitions. Word has length 62 [2021-06-05 07:44:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:54,696 INFO L482 AbstractCegarLoop]: Abstraction has 53160 states and 225104 transitions. [2021-06-05 07:44:54,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 225104 transitions. [2021-06-05 07:44:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 07:44:54,713 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:54,713 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:54,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 07:44:54,713 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -27681967, now seen corresponding path program 1 times [2021-06-05 07:44:54,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:54,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047889061] [2021-06-05 07:44:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:55,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:55,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047889061] [2021-06-05 07:44:55,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047889061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:55,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:55,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:44:55,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644944930] [2021-06-05 07:44:55,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:44:55,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:44:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:44:55,121 INFO L87 Difference]: Start difference. First operand 53160 states and 225104 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:56,845 INFO L93 Difference]: Finished difference Result 64389 states and 274500 transitions. [2021-06-05 07:44:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:44:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 07:44:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:57,031 INFO L225 Difference]: With dead ends: 64389 [2021-06-05 07:44:57,031 INFO L226 Difference]: Without dead ends: 64119 [2021-06-05 07:44:57,032 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 847.8ms TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 07:44:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2021-06-05 07:44:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 54940. [2021-06-05 07:44:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54940 states, 54938 states have (on average 4.293439877680294) internal successors, (235873), 54939 states have internal predecessors, (235873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54940 states to 54940 states and 235873 transitions. [2021-06-05 07:44:58,459 INFO L78 Accepts]: Start accepts. Automaton has 54940 states and 235873 transitions. Word has length 65 [2021-06-05 07:44:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:44:58,459 INFO L482 AbstractCegarLoop]: Abstraction has 54940 states and 235873 transitions. [2021-06-05 07:44:58,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54940 states and 235873 transitions. [2021-06-05 07:44:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 07:44:58,477 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:44:58,477 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:44:58,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 07:44:58,477 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:44:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:44:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash 225742194, now seen corresponding path program 1 times [2021-06-05 07:44:58,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:44:58,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110198386] [2021-06-05 07:44:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:44:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:44:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:44:58,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:44:58,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110198386] [2021-06-05 07:44:58,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110198386] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:44:58,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:44:58,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 07:44:58,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926178581] [2021-06-05 07:44:58,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 07:44:58,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:44:58,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 07:44:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 07:44:58,530 INFO L87 Difference]: Start difference. First operand 54940 states and 235873 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:44:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:44:59,471 INFO L93 Difference]: Finished difference Result 74107 states and 309485 transitions. [2021-06-05 07:44:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 07:44:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 07:44:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:44:59,656 INFO L225 Difference]: With dead ends: 74107 [2021-06-05 07:44:59,656 INFO L226 Difference]: Without dead ends: 67995 [2021-06-05 07:44:59,657 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 107.4ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:44:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67995 states. [2021-06-05 07:45:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67995 to 55174. [2021-06-05 07:45:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55174 states, 55172 states have (on average 4.289802798520989) internal successors, (236677), 55173 states have internal predecessors, (236677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 236677 transitions. [2021-06-05 07:45:01,247 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 236677 transitions. Word has length 65 [2021-06-05 07:45:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:01,247 INFO L482 AbstractCegarLoop]: Abstraction has 55174 states and 236677 transitions. [2021-06-05 07:45:01,247 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 236677 transitions. [2021-06-05 07:45:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 07:45:01,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:01,271 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:01,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 07:45:01,271 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash -405027412, now seen corresponding path program 2 times [2021-06-05 07:45:01,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:01,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447021619] [2021-06-05 07:45:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:01,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:01,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447021619] [2021-06-05 07:45:01,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447021619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:01,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:01,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:45:01,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830931399] [2021-06-05 07:45:01,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:45:01,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:45:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:45:01,413 INFO L87 Difference]: Start difference. First operand 55174 states and 236677 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:02,623 INFO L93 Difference]: Finished difference Result 72794 states and 304360 transitions. [2021-06-05 07:45:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:45:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 07:45:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:02,939 INFO L225 Difference]: With dead ends: 72794 [2021-06-05 07:45:02,939 INFO L226 Difference]: Without dead ends: 66814 [2021-06-05 07:45:02,939 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 201.7ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:45:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66814 states. [2021-06-05 07:45:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66814 to 54455. [2021-06-05 07:45:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54455 states, 54453 states have (on average 4.294363946889979) internal successors, (233841), 54454 states have internal predecessors, (233841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54455 states to 54455 states and 233841 transitions. [2021-06-05 07:45:04,488 INFO L78 Accepts]: Start accepts. Automaton has 54455 states and 233841 transitions. Word has length 65 [2021-06-05 07:45:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:04,488 INFO L482 AbstractCegarLoop]: Abstraction has 54455 states and 233841 transitions. [2021-06-05 07:45:04,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 54455 states and 233841 transitions. [2021-06-05 07:45:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 07:45:04,514 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:04,514 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:04,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 07:45:04,514 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1600315377, now seen corresponding path program 1 times [2021-06-05 07:45:04,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:04,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501438934] [2021-06-05 07:45:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:04,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:04,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501438934] [2021-06-05 07:45:04,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501438934] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:04,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:04,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:45:04,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775954964] [2021-06-05 07:45:04,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:45:04,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:45:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:45:04,917 INFO L87 Difference]: Start difference. First operand 54455 states and 233841 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:06,691 INFO L93 Difference]: Finished difference Result 60956 states and 259147 transitions. [2021-06-05 07:45:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 07:45:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 07:45:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:06,854 INFO L225 Difference]: With dead ends: 60956 [2021-06-05 07:45:06,854 INFO L226 Difference]: Without dead ends: 60614 [2021-06-05 07:45:06,854 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 812.4ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:45:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60614 states. [2021-06-05 07:45:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60614 to 49129. [2021-06-05 07:45:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49129 states, 49127 states have (on average 4.269749832067905) internal successors, (209760), 49128 states have internal predecessors, (209760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49129 states to 49129 states and 209760 transitions. [2021-06-05 07:45:08,148 INFO L78 Accepts]: Start accepts. Automaton has 49129 states and 209760 transitions. Word has length 67 [2021-06-05 07:45:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:08,148 INFO L482 AbstractCegarLoop]: Abstraction has 49129 states and 209760 transitions. [2021-06-05 07:45:08,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49129 states and 209760 transitions. [2021-06-05 07:45:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:08,175 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:08,175 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:08,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 07:45:08,175 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1860189259, now seen corresponding path program 1 times [2021-06-05 07:45:08,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:08,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565869475] [2021-06-05 07:45:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:08,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:08,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565869475] [2021-06-05 07:45:08,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565869475] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:08,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:08,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:45:08,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744897532] [2021-06-05 07:45:08,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:45:08,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:45:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:45:08,669 INFO L87 Difference]: Start difference. First operand 49129 states and 209760 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:10,499 INFO L93 Difference]: Finished difference Result 55018 states and 232303 transitions. [2021-06-05 07:45:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 07:45:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:10,643 INFO L225 Difference]: With dead ends: 55018 [2021-06-05 07:45:10,643 INFO L226 Difference]: Without dead ends: 53779 [2021-06-05 07:45:10,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 972.0ms TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 07:45:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53779 states. [2021-06-05 07:45:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53779 to 51011. [2021-06-05 07:45:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51011 states, 51009 states have (on average 4.255660765747221) internal successors, (217077), 51010 states have internal predecessors, (217077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51011 states to 51011 states and 217077 transitions. [2021-06-05 07:45:11,965 INFO L78 Accepts]: Start accepts. Automaton has 51011 states and 217077 transitions. Word has length 68 [2021-06-05 07:45:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:11,965 INFO L482 AbstractCegarLoop]: Abstraction has 51011 states and 217077 transitions. [2021-06-05 07:45:11,965 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 51011 states and 217077 transitions. [2021-06-05 07:45:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:11,990 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:11,990 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:11,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 07:45:11,990 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827065, now seen corresponding path program 2 times [2021-06-05 07:45:11,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:11,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464021450] [2021-06-05 07:45:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:12,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:12,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464021450] [2021-06-05 07:45:12,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464021450] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:12,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:12,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:45:12,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596939407] [2021-06-05 07:45:12,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:45:12,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:45:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:45:12,728 INFO L87 Difference]: Start difference. First operand 51011 states and 217077 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:13,988 INFO L93 Difference]: Finished difference Result 57059 states and 240069 transitions. [2021-06-05 07:45:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:45:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:14,136 INFO L225 Difference]: With dead ends: 57059 [2021-06-05 07:45:14,136 INFO L226 Difference]: Without dead ends: 55775 [2021-06-05 07:45:14,137 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1090.4ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:45:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55775 states. [2021-06-05 07:45:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55775 to 51041. [2021-06-05 07:45:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51041 states, 51039 states have (on average 4.254511256098278) internal successors, (217146), 51040 states have internal predecessors, (217146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51041 states to 51041 states and 217146 transitions. [2021-06-05 07:45:15,447 INFO L78 Accepts]: Start accepts. Automaton has 51041 states and 217146 transitions. Word has length 68 [2021-06-05 07:45:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:15,447 INFO L482 AbstractCegarLoop]: Abstraction has 51041 states and 217146 transitions. [2021-06-05 07:45:15,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 51041 states and 217146 transitions. [2021-06-05 07:45:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:15,471 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:15,471 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:15,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 07:45:15,472 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1587679323, now seen corresponding path program 3 times [2021-06-05 07:45:15,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:15,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360386743] [2021-06-05 07:45:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:16,187 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:16,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360386743] [2021-06-05 07:45:16,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360386743] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:16,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:16,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:45:16,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359184864] [2021-06-05 07:45:16,188 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:45:16,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:45:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:45:16,188 INFO L87 Difference]: Start difference. First operand 51041 states and 217146 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:17,279 INFO L93 Difference]: Finished difference Result 57090 states and 240097 transitions. [2021-06-05 07:45:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:45:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:17,429 INFO L225 Difference]: With dead ends: 57090 [2021-06-05 07:45:17,429 INFO L226 Difference]: Without dead ends: 55761 [2021-06-05 07:45:17,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 995.5ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 07:45:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55761 states. [2021-06-05 07:45:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55761 to 51081. [2021-06-05 07:45:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51079 states have (on average 4.252882789404648) internal successors, (217233), 51080 states have internal predecessors, (217233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 217233 transitions. [2021-06-05 07:45:18,767 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 217233 transitions. Word has length 68 [2021-06-05 07:45:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:18,767 INFO L482 AbstractCegarLoop]: Abstraction has 51081 states and 217233 transitions. [2021-06-05 07:45:18,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 217233 transitions. [2021-06-05 07:45:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:18,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:18,793 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:18,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 07:45:18,794 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1285672051, now seen corresponding path program 4 times [2021-06-05 07:45:18,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:18,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957624986] [2021-06-05 07:45:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:19,357 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2021-06-05 07:45:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:19,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:19,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957624986] [2021-06-05 07:45:19,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957624986] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:19,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:19,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 07:45:19,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536589979] [2021-06-05 07:45:19,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 07:45:19,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 07:45:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 07:45:19,521 INFO L87 Difference]: Start difference. First operand 51081 states and 217233 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:21,038 INFO L93 Difference]: Finished difference Result 57180 states and 240266 transitions. [2021-06-05 07:45:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 07:45:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:21,186 INFO L225 Difference]: With dead ends: 57180 [2021-06-05 07:45:21,186 INFO L226 Difference]: Without dead ends: 55851 [2021-06-05 07:45:21,186 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1146.1ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 07:45:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55851 states. [2021-06-05 07:45:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55851 to 51102. [2021-06-05 07:45:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51102 states, 51100 states have (on average 4.251859099804305) internal successors, (217270), 51101 states have internal predecessors, (217270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51102 states to 51102 states and 217270 transitions. [2021-06-05 07:45:22,478 INFO L78 Accepts]: Start accepts. Automaton has 51102 states and 217270 transitions. Word has length 68 [2021-06-05 07:45:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:22,479 INFO L482 AbstractCegarLoop]: Abstraction has 51102 states and 217270 transitions. [2021-06-05 07:45:22,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51102 states and 217270 transitions. [2021-06-05 07:45:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:22,760 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:22,760 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:22,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 07:45:22,760 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -747687525, now seen corresponding path program 5 times [2021-06-05 07:45:22,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:22,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136484355] [2021-06-05 07:45:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:23,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:23,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136484355] [2021-06-05 07:45:23,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136484355] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:23,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:23,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:45:23,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116474470] [2021-06-05 07:45:23,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:45:23,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:45:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:45:23,042 INFO L87 Difference]: Start difference. First operand 51102 states and 217270 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:23,849 INFO L93 Difference]: Finished difference Result 57173 states and 240259 transitions. [2021-06-05 07:45:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 07:45:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:23,997 INFO L225 Difference]: With dead ends: 57173 [2021-06-05 07:45:23,997 INFO L226 Difference]: Without dead ends: 55844 [2021-06-05 07:45:23,998 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 363.7ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:45:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55844 states. [2021-06-05 07:45:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55844 to 51103. [2021-06-05 07:45:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51101 states have (on average 4.251795463885247) internal successors, (217271), 51102 states have internal predecessors, (217271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 217271 transitions. [2021-06-05 07:45:25,307 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 217271 transitions. Word has length 68 [2021-06-05 07:45:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:25,307 INFO L482 AbstractCegarLoop]: Abstraction has 51103 states and 217271 transitions. [2021-06-05 07:45:25,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 217271 transitions. [2021-06-05 07:45:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:25,333 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:25,333 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:25,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 07:45:25,333 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 229412969, now seen corresponding path program 6 times [2021-06-05 07:45:25,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:25,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815783247] [2021-06-05 07:45:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:25,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:25,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815783247] [2021-06-05 07:45:25,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815783247] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:25,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:25,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:45:25,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295657877] [2021-06-05 07:45:25,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:45:25,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:25,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:45:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:45:25,574 INFO L87 Difference]: Start difference. First operand 51103 states and 217271 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:26,603 INFO L93 Difference]: Finished difference Result 57203 states and 240305 transitions. [2021-06-05 07:45:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 07:45:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:26,752 INFO L225 Difference]: With dead ends: 57203 [2021-06-05 07:45:26,752 INFO L226 Difference]: Without dead ends: 55874 [2021-06-05 07:45:26,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 371.9ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 07:45:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55874 states. [2021-06-05 07:45:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55874 to 51132. [2021-06-05 07:45:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51132 states, 51130 states have (on average 4.250264032857422) internal successors, (217316), 51131 states have internal predecessors, (217316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51132 states to 51132 states and 217316 transitions. [2021-06-05 07:45:28,064 INFO L78 Accepts]: Start accepts. Automaton has 51132 states and 217316 transitions. Word has length 68 [2021-06-05 07:45:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:28,065 INFO L482 AbstractCegarLoop]: Abstraction has 51132 states and 217316 transitions. [2021-06-05 07:45:28,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 51132 states and 217316 transitions. [2021-06-05 07:45:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 07:45:28,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:28,091 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:28,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 07:45:28,091 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -838870671, now seen corresponding path program 7 times [2021-06-05 07:45:28,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:28,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443650424] [2021-06-05 07:45:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:28,276 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:28,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443650424] [2021-06-05 07:45:28,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443650424] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:28,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:28,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 07:45:28,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882386236] [2021-06-05 07:45:28,277 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 07:45:28,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 07:45:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-06-05 07:45:28,277 INFO L87 Difference]: Start difference. First operand 51132 states and 217316 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:29,181 INFO L93 Difference]: Finished difference Result 55837 states and 234184 transitions. [2021-06-05 07:45:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:45:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 07:45:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:29,333 INFO L225 Difference]: With dead ends: 55837 [2021-06-05 07:45:29,333 INFO L226 Difference]: Without dead ends: 54508 [2021-06-05 07:45:29,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 222.8ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:45:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54508 states. [2021-06-05 07:45:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54508 to 49737. [2021-06-05 07:45:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.245501156127475) internal successors, (211150), 49736 states have internal predecessors, (211150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211150 transitions. [2021-06-05 07:45:30,686 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211150 transitions. Word has length 68 [2021-06-05 07:45:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:30,686 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211150 transitions. [2021-06-05 07:45:30,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211150 transitions. [2021-06-05 07:45:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 07:45:30,717 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:30,717 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:30,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 07:45:30,717 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash 834173378, now seen corresponding path program 1 times [2021-06-05 07:45:30,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:30,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234051858] [2021-06-05 07:45:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:31,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:31,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234051858] [2021-06-05 07:45:31,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234051858] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:31,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:31,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:45:31,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865288926] [2021-06-05 07:45:31,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:45:31,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:45:31,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:45:31,170 INFO L87 Difference]: Start difference. First operand 49737 states and 211150 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:33,025 INFO L93 Difference]: Finished difference Result 57256 states and 239996 transitions. [2021-06-05 07:45:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:45:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 07:45:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:33,174 INFO L225 Difference]: With dead ends: 57256 [2021-06-05 07:45:33,174 INFO L226 Difference]: Without dead ends: 56134 [2021-06-05 07:45:33,174 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 964.2ms TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 07:45:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56134 states. [2021-06-05 07:45:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56134 to 49737. [2021-06-05 07:45:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.244596360711772) internal successors, (211105), 49736 states have internal predecessors, (211105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211105 transitions. [2021-06-05 07:45:34,419 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211105 transitions. Word has length 70 [2021-06-05 07:45:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:34,419 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211105 transitions. [2021-06-05 07:45:34,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211105 transitions. [2021-06-05 07:45:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 07:45:34,450 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:34,450 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:34,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 07:45:34,450 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1768735654, now seen corresponding path program 2 times [2021-06-05 07:45:34,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:34,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99446020] [2021-06-05 07:45:34,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:34,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:34,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99446020] [2021-06-05 07:45:34,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99446020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:34,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:34,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:45:34,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446026556] [2021-06-05 07:45:34,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:45:34,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:45:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:45:34,867 INFO L87 Difference]: Start difference. First operand 49737 states and 211105 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:36,517 INFO L93 Difference]: Finished difference Result 56867 states and 238439 transitions. [2021-06-05 07:45:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:45:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 07:45:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:36,664 INFO L225 Difference]: With dead ends: 56867 [2021-06-05 07:45:36,664 INFO L226 Difference]: Without dead ends: 55700 [2021-06-05 07:45:36,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 763.5ms TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 07:45:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55700 states. [2021-06-05 07:45:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55700 to 49329. [2021-06-05 07:45:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49329 states, 49327 states have (on average 4.248768422973219) internal successors, (209579), 49328 states have internal predecessors, (209579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49329 states to 49329 states and 209579 transitions. [2021-06-05 07:45:38,006 INFO L78 Accepts]: Start accepts. Automaton has 49329 states and 209579 transitions. Word has length 70 [2021-06-05 07:45:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:38,006 INFO L482 AbstractCegarLoop]: Abstraction has 49329 states and 209579 transitions. [2021-06-05 07:45:38,006 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 49329 states and 209579 transitions. [2021-06-05 07:45:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 07:45:38,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:38,040 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:38,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 07:45:38,040 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:38,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1979887372, now seen corresponding path program 3 times [2021-06-05 07:45:38,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:38,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546291532] [2021-06-05 07:45:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:38,379 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:38,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546291532] [2021-06-05 07:45:38,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546291532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:38,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:38,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:45:38,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318205259] [2021-06-05 07:45:38,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:45:38,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:45:38,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:45:38,380 INFO L87 Difference]: Start difference. First operand 49329 states and 209579 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:39,843 INFO L93 Difference]: Finished difference Result 53309 states and 223950 transitions. [2021-06-05 07:45:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 07:45:39,843 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 07:45:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:39,984 INFO L225 Difference]: With dead ends: 53309 [2021-06-05 07:45:39,985 INFO L226 Difference]: Without dead ends: 52526 [2021-06-05 07:45:39,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 597.8ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 07:45:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52526 states. [2021-06-05 07:45:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52526 to 46131. [2021-06-05 07:45:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46131 states, 46129 states have (on average 4.255609269656832) internal successors, (196307), 46130 states have internal predecessors, (196307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46131 states to 46131 states and 196307 transitions. [2021-06-05 07:45:41,216 INFO L78 Accepts]: Start accepts. Automaton has 46131 states and 196307 transitions. Word has length 70 [2021-06-05 07:45:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:41,217 INFO L482 AbstractCegarLoop]: Abstraction has 46131 states and 196307 transitions. [2021-06-05 07:45:41,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 46131 states and 196307 transitions. [2021-06-05 07:45:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 07:45:41,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:41,247 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:41,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 07:45:41,248 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1636468715, now seen corresponding path program 1 times [2021-06-05 07:45:41,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:41,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159754541] [2021-06-05 07:45:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:41,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:41,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159754541] [2021-06-05 07:45:41,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159754541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:41,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:41,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:45:41,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66603815] [2021-06-05 07:45:41,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:45:41,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:45:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:45:41,743 INFO L87 Difference]: Start difference. First operand 46131 states and 196307 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:43,596 INFO L93 Difference]: Finished difference Result 46335 states and 194500 transitions. [2021-06-05 07:45:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 07:45:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 07:45:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:43,710 INFO L225 Difference]: With dead ends: 46335 [2021-06-05 07:45:43,710 INFO L226 Difference]: Without dead ends: 45255 [2021-06-05 07:45:43,710 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1032.2ms TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 07:45:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45255 states. [2021-06-05 07:45:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45255 to 40527. [2021-06-05 07:45:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 4.238864898210981) internal successors, (171780), 40526 states have internal predecessors, (171780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 171780 transitions. [2021-06-05 07:45:44,777 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 171780 transitions. Word has length 71 [2021-06-05 07:45:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:44,778 INFO L482 AbstractCegarLoop]: Abstraction has 40527 states and 171780 transitions. [2021-06-05 07:45:44,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 171780 transitions. [2021-06-05 07:45:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 07:45:44,810 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:44,810 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:44,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 07:45:44,810 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -992111004, now seen corresponding path program 1 times [2021-06-05 07:45:44,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:44,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204107344] [2021-06-05 07:45:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:44,856 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:44,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204107344] [2021-06-05 07:45:44,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204107344] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:44,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:44,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 07:45:44,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865361854] [2021-06-05 07:45:44,857 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 07:45:44,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 07:45:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 07:45:44,857 INFO L87 Difference]: Start difference. First operand 40527 states and 171780 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:45,323 INFO L93 Difference]: Finished difference Result 62148 states and 255238 transitions. [2021-06-05 07:45:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 07:45:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 07:45:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:45,434 INFO L225 Difference]: With dead ends: 62148 [2021-06-05 07:45:45,434 INFO L226 Difference]: Without dead ends: 47082 [2021-06-05 07:45:45,434 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:45:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2021-06-05 07:45:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 37407. [2021-06-05 07:45:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37407 states, 37405 states have (on average 4.195535356235798) internal successors, (156934), 37406 states have internal predecessors, (156934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 156934 transitions. [2021-06-05 07:45:46,555 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 156934 transitions. Word has length 71 [2021-06-05 07:45:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:46,555 INFO L482 AbstractCegarLoop]: Abstraction has 37407 states and 156934 transitions. [2021-06-05 07:45:46,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 156934 transitions. [2021-06-05 07:45:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 07:45:46,584 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:46,584 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:46,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 07:45:46,584 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash 617757196, now seen corresponding path program 2 times [2021-06-05 07:45:46,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:46,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668948674] [2021-06-05 07:45:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:46,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:46,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668948674] [2021-06-05 07:45:46,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668948674] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:46,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:46,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:45:46,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793612649] [2021-06-05 07:45:46,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:45:46,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:46,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:45:46,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:45:46,659 INFO L87 Difference]: Start difference. First operand 37407 states and 156934 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:47,478 INFO L93 Difference]: Finished difference Result 52101 states and 213437 transitions. [2021-06-05 07:45:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 07:45:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 07:45:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:47,592 INFO L225 Difference]: With dead ends: 52101 [2021-06-05 07:45:47,592 INFO L226 Difference]: Without dead ends: 45375 [2021-06-05 07:45:47,593 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 175.3ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:45:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45375 states. [2021-06-05 07:45:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45375 to 37416. [2021-06-05 07:45:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37414 states have (on average 4.195648687657027) internal successors, (156976), 37415 states have internal predecessors, (156976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 156976 transitions. [2021-06-05 07:45:48,765 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 156976 transitions. Word has length 71 [2021-06-05 07:45:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:48,765 INFO L482 AbstractCegarLoop]: Abstraction has 37416 states and 156976 transitions. [2021-06-05 07:45:48,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 156976 transitions. [2021-06-05 07:45:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 07:45:48,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:48,797 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:48,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 07:45:48,797 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1562092050, now seen corresponding path program 3 times [2021-06-05 07:45:48,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:48,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930396531] [2021-06-05 07:45:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:48,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:48,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930396531] [2021-06-05 07:45:48,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930396531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:48,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:48,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 07:45:48,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354393202] [2021-06-05 07:45:48,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 07:45:48,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 07:45:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-05 07:45:48,932 INFO L87 Difference]: Start difference. First operand 37416 states and 156976 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:49,439 INFO L93 Difference]: Finished difference Result 47706 states and 195499 transitions. [2021-06-05 07:45:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:45:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 07:45:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:49,541 INFO L225 Difference]: With dead ends: 47706 [2021-06-05 07:45:49,541 INFO L226 Difference]: Without dead ends: 42690 [2021-06-05 07:45:49,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 246.5ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-06-05 07:45:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2021-06-05 07:45:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 34959. [2021-06-05 07:45:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34959 states, 34957 states have (on average 4.183539777440856) internal successors, (146244), 34958 states have internal predecessors, (146244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34959 states to 34959 states and 146244 transitions. [2021-06-05 07:45:50,505 INFO L78 Accepts]: Start accepts. Automaton has 34959 states and 146244 transitions. Word has length 71 [2021-06-05 07:45:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:50,505 INFO L482 AbstractCegarLoop]: Abstraction has 34959 states and 146244 transitions. [2021-06-05 07:45:50,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34959 states and 146244 transitions. [2021-06-05 07:45:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 07:45:50,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:50,537 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:50,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 07:45:50,537 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:50,538 INFO L82 PathProgramCache]: Analyzing trace with hash -450918615, now seen corresponding path program 1 times [2021-06-05 07:45:50,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:50,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348110552] [2021-06-05 07:45:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:51,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:51,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348110552] [2021-06-05 07:45:51,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348110552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:51,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:51,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:45:51,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204682999] [2021-06-05 07:45:51,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:45:51,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:45:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:45:51,032 INFO L87 Difference]: Start difference. First operand 34959 states and 146244 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:52,772 INFO L93 Difference]: Finished difference Result 35853 states and 147820 transitions. [2021-06-05 07:45:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:45:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 07:45:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:52,856 INFO L225 Difference]: With dead ends: 35853 [2021-06-05 07:45:52,856 INFO L226 Difference]: Without dead ends: 34053 [2021-06-05 07:45:52,856 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1093.4ms TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 07:45:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2021-06-05 07:45:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 29025. [2021-06-05 07:45:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 29023 states have (on average 4.175447059228888) internal successors, (121184), 29024 states have internal predecessors, (121184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 121184 transitions. [2021-06-05 07:45:53,456 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 121184 transitions. Word has length 73 [2021-06-05 07:45:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:53,457 INFO L482 AbstractCegarLoop]: Abstraction has 29025 states and 121184 transitions. [2021-06-05 07:45:53,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 121184 transitions. [2021-06-05 07:45:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 07:45:53,484 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:53,484 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:53,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 07:45:53,484 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 958835916, now seen corresponding path program 1 times [2021-06-05 07:45:53,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:53,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234043983] [2021-06-05 07:45:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:54,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:54,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234043983] [2021-06-05 07:45:54,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234043983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:54,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:54,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:45:54,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636160630] [2021-06-05 07:45:54,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:45:54,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:54,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:45:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:45:54,392 INFO L87 Difference]: Start difference. First operand 29025 states and 121184 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:56,998 INFO L93 Difference]: Finished difference Result 38504 states and 159667 transitions. [2021-06-05 07:45:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 07:45:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 07:45:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:45:57,085 INFO L225 Difference]: With dead ends: 38504 [2021-06-05 07:45:57,086 INFO L226 Difference]: Without dead ends: 34922 [2021-06-05 07:45:57,086 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1874.2ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 07:45:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34922 states. [2021-06-05 07:45:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34922 to 29592. [2021-06-05 07:45:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29592 states, 29590 states have (on average 4.223893207164583) internal successors, (124985), 29591 states have internal predecessors, (124985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29592 states to 29592 states and 124985 transitions. [2021-06-05 07:45:57,709 INFO L78 Accepts]: Start accepts. Automaton has 29592 states and 124985 transitions. Word has length 73 [2021-06-05 07:45:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:45:57,710 INFO L482 AbstractCegarLoop]: Abstraction has 29592 states and 124985 transitions. [2021-06-05 07:45:57,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 29592 states and 124985 transitions. [2021-06-05 07:45:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 07:45:57,739 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:45:57,739 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:45:57,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 07:45:57,739 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:45:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:45:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 937574186, now seen corresponding path program 2 times [2021-06-05 07:45:57,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:45:57,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118885236] [2021-06-05 07:45:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:45:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:45:58,142 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2021-06-05 07:45:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:45:58,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:45:58,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118885236] [2021-06-05 07:45:58,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118885236] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:45:58,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:45:58,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-06-05 07:45:58,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908107620] [2021-06-05 07:45:58,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 07:45:58,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:45:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 07:45:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-06-05 07:45:58,493 INFO L87 Difference]: Start difference. First operand 29592 states and 124985 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:45:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:45:59,982 INFO L93 Difference]: Finished difference Result 29856 states and 124699 transitions. [2021-06-05 07:45:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 07:45:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 07:45:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:00,050 INFO L225 Difference]: With dead ends: 29856 [2021-06-05 07:46:00,050 INFO L226 Difference]: Without dead ends: 27300 [2021-06-05 07:46:00,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1281.1ms TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:46:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27300 states. [2021-06-05 07:46:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27300 to 19407. [2021-06-05 07:46:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19405 states have (on average 4.1668126771450655) internal successors, (80857), 19406 states have internal predecessors, (80857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 80857 transitions. [2021-06-05 07:46:00,574 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 80857 transitions. Word has length 73 [2021-06-05 07:46:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:00,574 INFO L482 AbstractCegarLoop]: Abstraction has 19407 states and 80857 transitions. [2021-06-05 07:46:00,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 80857 transitions. [2021-06-05 07:46:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:00,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:00,596 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:00,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 07:46:00,596 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash 461088309, now seen corresponding path program 1 times [2021-06-05 07:46:00,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:00,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762079093] [2021-06-05 07:46:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:01,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:01,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762079093] [2021-06-05 07:46:01,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762079093] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:01,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:01,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:46:01,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131811141] [2021-06-05 07:46:01,120 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:46:01,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:46:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:46:01,120 INFO L87 Difference]: Start difference. First operand 19407 states and 80857 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:02,617 INFO L93 Difference]: Finished difference Result 23428 states and 95519 transitions. [2021-06-05 07:46:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 07:46:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:02,673 INFO L225 Difference]: With dead ends: 23428 [2021-06-05 07:46:02,673 INFO L226 Difference]: Without dead ends: 22564 [2021-06-05 07:46:02,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1001.8ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 07:46:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22564 states. [2021-06-05 07:46:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22564 to 21544. [2021-06-05 07:46:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-06-05 07:46:03,068 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-06-05 07:46:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:03,069 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-06-05 07:46:03,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-06-05 07:46:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:03,093 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:03,093 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:03,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 07:46:03,093 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash 563120435, now seen corresponding path program 2 times [2021-06-05 07:46:03,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:03,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597512629] [2021-06-05 07:46:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:03,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:03,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597512629] [2021-06-05 07:46:03,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597512629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:03,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:03,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:46:03,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473973475] [2021-06-05 07:46:03,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:46:03,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:46:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:46:03,594 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:04,920 INFO L93 Difference]: Finished difference Result 24815 states and 100343 transitions. [2021-06-05 07:46:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 07:46:04,920 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:04,974 INFO L225 Difference]: With dead ends: 24815 [2021-06-05 07:46:04,974 INFO L226 Difference]: Without dead ends: 23951 [2021-06-05 07:46:04,974 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1000.5ms TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 07:46:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2021-06-05 07:46:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 21544. [2021-06-05 07:46:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-06-05 07:46:05,389 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-06-05 07:46:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:05,389 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-06-05 07:46:05,389 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-06-05 07:46:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:05,414 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:05,414 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:05,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 07:46:05,415 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -374211371, now seen corresponding path program 3 times [2021-06-05 07:46:05,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:05,415 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448897948] [2021-06-05 07:46:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:05,969 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:05,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448897948] [2021-06-05 07:46:05,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448897948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:05,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:05,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:46:05,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685990157] [2021-06-05 07:46:05,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:46:05,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:46:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:46:05,970 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:07,896 INFO L93 Difference]: Finished difference Result 26738 states and 107510 transitions. [2021-06-05 07:46:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 07:46:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:07,948 INFO L225 Difference]: With dead ends: 26738 [2021-06-05 07:46:07,949 INFO L226 Difference]: Without dead ends: 23282 [2021-06-05 07:46:07,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1118.1ms TimeCoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 07:46:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23282 states. [2021-06-05 07:46:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23282 to 18952. [2021-06-05 07:46:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 18950 states have (on average 4.075092348284961) internal successors, (77223), 18951 states have internal predecessors, (77223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 77223 transitions. [2021-06-05 07:46:08,415 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 77223 transitions. Word has length 74 [2021-06-05 07:46:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:08,415 INFO L482 AbstractCegarLoop]: Abstraction has 18952 states and 77223 transitions. [2021-06-05 07:46:08,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 77223 transitions. [2021-06-05 07:46:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:08,436 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:08,436 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:08,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 07:46:08,436 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash 447738003, now seen corresponding path program 4 times [2021-06-05 07:46:08,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:08,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923539230] [2021-06-05 07:46:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:08,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:08,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923539230] [2021-06-05 07:46:08,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923539230] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:08,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:08,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 07:46:08,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035667529] [2021-06-05 07:46:08,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 07:46:08,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 07:46:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 07:46:08,828 INFO L87 Difference]: Start difference. First operand 18952 states and 77223 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:10,082 INFO L93 Difference]: Finished difference Result 22543 states and 89781 transitions. [2021-06-05 07:46:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:46:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:10,130 INFO L225 Difference]: With dead ends: 22543 [2021-06-05 07:46:10,131 INFO L226 Difference]: Without dead ends: 21679 [2021-06-05 07:46:10,131 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 764.0ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 07:46:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-06-05 07:46:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 19122. [2021-06-05 07:46:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19122 states, 19120 states have (on average 4.065585774058578) internal successors, (77734), 19121 states have internal predecessors, (77734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 77734 transitions. [2021-06-05 07:46:10,600 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 77734 transitions. Word has length 74 [2021-06-05 07:46:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:10,601 INFO L482 AbstractCegarLoop]: Abstraction has 19122 states and 77734 transitions. [2021-06-05 07:46:10,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 77734 transitions. [2021-06-05 07:46:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:10,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:10,622 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:10,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 07:46:10,622 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1081503733, now seen corresponding path program 5 times [2021-06-05 07:46:10,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:10,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541216787] [2021-06-05 07:46:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:10,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:10,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541216787] [2021-06-05 07:46:10,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541216787] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:10,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:10,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:46:10,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106456807] [2021-06-05 07:46:10,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:46:10,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:46:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:46:10,968 INFO L87 Difference]: Start difference. First operand 19122 states and 77734 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:11,961 INFO L93 Difference]: Finished difference Result 22763 states and 90402 transitions. [2021-06-05 07:46:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 07:46:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:12,008 INFO L225 Difference]: With dead ends: 22763 [2021-06-05 07:46:12,008 INFO L226 Difference]: Without dead ends: 21899 [2021-06-05 07:46:12,008 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 610.2ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 07:46:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2021-06-05 07:46:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 19172. [2021-06-05 07:46:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 19170 states have (on average 4.060719874804382) internal successors, (77844), 19171 states have internal predecessors, (77844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 77844 transitions. [2021-06-05 07:46:12,479 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 77844 transitions. Word has length 74 [2021-06-05 07:46:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:12,479 INFO L482 AbstractCegarLoop]: Abstraction has 19172 states and 77844 transitions. [2021-06-05 07:46:12,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 77844 transitions. [2021-06-05 07:46:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:12,501 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:12,501 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:12,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 07:46:12,501 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1223596091, now seen corresponding path program 6 times [2021-06-05 07:46:12,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:12,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161779709] [2021-06-05 07:46:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:12,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:12,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161779709] [2021-06-05 07:46:12,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161779709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:12,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:12,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 07:46:12,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587779293] [2021-06-05 07:46:12,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 07:46:12,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 07:46:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 07:46:12,996 INFO L87 Difference]: Start difference. First operand 19172 states and 77844 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:14,705 INFO L93 Difference]: Finished difference Result 22885 states and 90632 transitions. [2021-06-05 07:46:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 07:46:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:14,753 INFO L225 Difference]: With dead ends: 22885 [2021-06-05 07:46:14,753 INFO L226 Difference]: Without dead ends: 22021 [2021-06-05 07:46:14,754 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1333.2ms TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 07:46:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22021 states. [2021-06-05 07:46:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22021 to 19193. [2021-06-05 07:46:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19191 states have (on average 4.058204366630191) internal successors, (77881), 19192 states have internal predecessors, (77881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 77881 transitions. [2021-06-05 07:46:15,109 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 77881 transitions. Word has length 74 [2021-06-05 07:46:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:15,109 INFO L482 AbstractCegarLoop]: Abstraction has 19193 states and 77881 transitions. [2021-06-05 07:46:15,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 77881 transitions. [2021-06-05 07:46:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:15,130 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:15,130 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:15,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 07:46:15,130 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1885361097, now seen corresponding path program 7 times [2021-06-05 07:46:15,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:15,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104264476] [2021-06-05 07:46:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:15,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:15,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104264476] [2021-06-05 07:46:15,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104264476] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:15,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:15,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:46:15,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698814651] [2021-06-05 07:46:15,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:46:15,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:15,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:46:15,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:46:15,371 INFO L87 Difference]: Start difference. First operand 19193 states and 77881 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:16,088 INFO L93 Difference]: Finished difference Result 22856 states and 90587 transitions. [2021-06-05 07:46:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 07:46:16,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:16,248 INFO L225 Difference]: With dead ends: 22856 [2021-06-05 07:46:16,248 INFO L226 Difference]: Without dead ends: 21992 [2021-06-05 07:46:16,248 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 432.3ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 07:46:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2021-06-05 07:46:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 19194. [2021-06-05 07:46:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19192 states have (on average 4.058045018757816) internal successors, (77882), 19193 states have internal predecessors, (77882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 77882 transitions. [2021-06-05 07:46:16,588 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 77882 transitions. Word has length 74 [2021-06-05 07:46:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:16,588 INFO L482 AbstractCegarLoop]: Abstraction has 19194 states and 77882 transitions. [2021-06-05 07:46:16,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 77882 transitions. [2021-06-05 07:46:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:16,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:16,609 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:16,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 07:46:16,610 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1675812887, now seen corresponding path program 8 times [2021-06-05 07:46:16,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:16,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970153911] [2021-06-05 07:46:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:16,842 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:16,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970153911] [2021-06-05 07:46:16,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970153911] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:16,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:16,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 07:46:16,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157622659] [2021-06-05 07:46:16,843 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 07:46:16,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 07:46:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-05 07:46:16,844 INFO L87 Difference]: Start difference. First operand 19194 states and 77882 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:17,560 INFO L93 Difference]: Finished difference Result 22886 states and 90633 transitions. [2021-06-05 07:46:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 07:46:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:17,607 INFO L225 Difference]: With dead ends: 22886 [2021-06-05 07:46:17,607 INFO L226 Difference]: Without dead ends: 22022 [2021-06-05 07:46:17,608 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 411.4ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-06-05 07:46:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2021-06-05 07:46:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19223. [2021-06-05 07:46:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19221 states have (on average 4.054263565891473) internal successors, (77927), 19222 states have internal predecessors, (77927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 77927 transitions. [2021-06-05 07:46:18,058 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 77927 transitions. Word has length 74 [2021-06-05 07:46:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:18,058 INFO L482 AbstractCegarLoop]: Abstraction has 19223 states and 77927 transitions. [2021-06-05 07:46:18,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 77927 transitions. [2021-06-05 07:46:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 07:46:18,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:18,080 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:18,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 07:46:18,080 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1475525857, now seen corresponding path program 9 times [2021-06-05 07:46:18,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:18,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171246306] [2021-06-05 07:46:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:18,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:18,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171246306] [2021-06-05 07:46:18,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171246306] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:18,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:18,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 07:46:18,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676364846] [2021-06-05 07:46:18,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 07:46:18,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:18,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 07:46:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-06-05 07:46:18,286 INFO L87 Difference]: Start difference. First operand 19223 states and 77927 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:18,679 INFO L93 Difference]: Finished difference Result 21916 states and 86727 transitions. [2021-06-05 07:46:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 07:46:18,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 07:46:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:18,724 INFO L225 Difference]: With dead ends: 21916 [2021-06-05 07:46:18,724 INFO L226 Difference]: Without dead ends: 21052 [2021-06-05 07:46:18,724 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 247.1ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 07:46:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2021-06-05 07:46:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 18224. [2021-06-05 07:46:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-05 07:46:19,233 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 74 [2021-06-05 07:46:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:19,234 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-05 07:46:19,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-05 07:46:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 07:46:19,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:19,256 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:19,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 07:46:19,256 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1183741372, now seen corresponding path program 1 times [2021-06-05 07:46:19,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:19,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139946931] [2021-06-05 07:46:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:19,979 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:19,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139946931] [2021-06-05 07:46:19,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139946931] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:19,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:19,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 07:46:19,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686333088] [2021-06-05 07:46:19,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 07:46:19,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 07:46:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 07:46:19,980 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:21,703 INFO L93 Difference]: Finished difference Result 23749 states and 93878 transitions. [2021-06-05 07:46:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 07:46:21,704 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 07:46:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:21,753 INFO L225 Difference]: With dead ends: 23749 [2021-06-05 07:46:21,753 INFO L226 Difference]: Without dead ends: 23065 [2021-06-05 07:46:21,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1322.0ms TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 07:46:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2021-06-05 07:46:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 18224. [2021-06-05 07:46:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-05 07:46:22,082 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 76 [2021-06-05 07:46:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:22,083 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-05 07:46:22,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-05 07:46:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 07:46:22,105 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:22,106 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:22,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 07:46:22,106 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash -342292756, now seen corresponding path program 2 times [2021-06-05 07:46:22,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:22,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826279080] [2021-06-05 07:46:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:22,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:22,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826279080] [2021-06-05 07:46:22,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826279080] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:22,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:22,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-05 07:46:22,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822705417] [2021-06-05 07:46:22,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 07:46:22,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 07:46:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-06-05 07:46:22,600 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:24,213 INFO L93 Difference]: Finished difference Result 22030 states and 86807 transitions. [2021-06-05 07:46:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 07:46:24,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 07:46:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:24,261 INFO L225 Difference]: With dead ends: 22030 [2021-06-05 07:46:24,261 INFO L226 Difference]: Without dead ends: 21346 [2021-06-05 07:46:24,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 954.6ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 07:46:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2021-06-05 07:46:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 16478. [2021-06-05 07:46:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-05 07:46:24,610 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-05 07:46:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:24,610 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-05 07:46:24,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-05 07:46:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 07:46:24,631 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:24,631 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:24,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 07:46:24,631 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1885510190, now seen corresponding path program 3 times [2021-06-05 07:46:24,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:24,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136301801] [2021-06-05 07:46:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:25,086 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:25,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136301801] [2021-06-05 07:46:25,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136301801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:25,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:25,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-05 07:46:25,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351862049] [2021-06-05 07:46:25,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 07:46:25,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 07:46:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-06-05 07:46:25,087 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:26,163 INFO L93 Difference]: Finished difference Result 21346 states and 84263 transitions. [2021-06-05 07:46:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 07:46:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 07:46:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:26,209 INFO L225 Difference]: With dead ends: 21346 [2021-06-05 07:46:26,209 INFO L226 Difference]: Without dead ends: 21004 [2021-06-05 07:46:26,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 822.6ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 07:46:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21004 states. [2021-06-05 07:46:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21004 to 16478. [2021-06-05 07:46:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-05 07:46:26,541 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-05 07:46:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:26,541 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-05 07:46:26,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-05 07:46:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 07:46:26,562 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:26,562 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:26,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 07:46:26,562 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1564620922, now seen corresponding path program 4 times [2021-06-05 07:46:26,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:26,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296646838] [2021-06-05 07:46:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 07:46:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 07:46:26,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 07:46:26,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296646838] [2021-06-05 07:46:26,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296646838] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 07:46:26,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 07:46:26,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 07:46:26,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118854695] [2021-06-05 07:46:26,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 07:46:26,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 07:46:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 07:46:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 07:46:26,925 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 07:46:27,988 INFO L93 Difference]: Finished difference Result 16265 states and 64818 transitions. [2021-06-05 07:46:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 07:46:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 07:46:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 07:46:28,023 INFO L225 Difference]: With dead ends: 16265 [2021-06-05 07:46:28,023 INFO L226 Difference]: Without dead ends: 15923 [2021-06-05 07:46:28,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 654.1ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 07:46:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-06-05 07:46:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 11363. [2021-06-05 07:46:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11362 states have (on average 4.191867628938567) internal successors, (47628), 11362 states have internal predecessors, (47628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 47628 transitions. [2021-06-05 07:46:28,252 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 47628 transitions. Word has length 76 [2021-06-05 07:46:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 07:46:28,252 INFO L482 AbstractCegarLoop]: Abstraction has 11363 states and 47628 transitions. [2021-06-05 07:46:28,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 07:46:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 47628 transitions. [2021-06-05 07:46:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 07:46:28,270 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 07:46:28,270 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 07:46:28,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 07:46:28,270 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 07:46:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 07:46:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 511479404, now seen corresponding path program 1 times [2021-06-05 07:46:28,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 07:46:28,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900009383] [2021-06-05 07:46:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 07:46:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 07:46:28,286 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 07:46:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 07:46:28,305 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 07:46:28,335 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 07:46:28,335 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 07:46:28,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 07:46:28,335 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2021-06-05 07:46:28,337 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 07:46:28,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 07:46:28 BasicIcfg [2021-06-05 07:46:28,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 07:46:28,409 INFO L168 Benchmark]: Toolchain (without parser) took 153158.71 ms. Allocated memory was 362.8 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 324.1 MB in the beginning and 14.8 GB in the end (delta: -14.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 362.8 MB. Free memory is still 343.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.97 ms. Allocated memory is still 362.8 MB. Free memory was 323.9 MB in the beginning and 284.1 MB in the end (delta: 39.8 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.20 ms. Allocated memory is still 362.8 MB. Free memory was 284.1 MB in the beginning and 282.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 362.8 MB. Free memory was 282.0 MB in the beginning and 280.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: RCFGBuilder took 298.80 ms. Allocated memory is still 362.8 MB. Free memory was 280.3 MB in the beginning and 250.5 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 INFO L168 Benchmark]: TraceAbstraction took 152229.83 ms. Allocated memory was 362.8 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 249.7 MB in the beginning and 14.8 GB in the end (delta: -14.6 GB). Peak memory consumption was 976.6 MB. Max. memory is 16.0 GB. [2021-06-05 07:46:28,409 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.09 ms. Allocated memory is still 362.8 MB. Free memory is still 343.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 556.97 ms. Allocated memory is still 362.8 MB. Free memory was 323.9 MB in the beginning and 284.1 MB in the end (delta: 39.8 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.20 ms. Allocated memory is still 362.8 MB. Free memory was 284.1 MB in the beginning and 282.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 362.8 MB. Free memory was 282.0 MB in the beginning and 280.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 298.80 ms. Allocated memory is still 362.8 MB. Free memory was 280.3 MB in the beginning and 250.5 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 152229.83 ms. Allocated memory was 362.8 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 249.7 MB in the beginning and 14.8 GB in the end (delta: -14.6 GB). Peak memory consumption was 976.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1128] 2 return 0; VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t3, 0, thread3, 0)=0, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1163] 0 \read(t) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1142] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1164] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 151933.4ms, OverallIterations: 51, TraceHistogramMax: 1, EmptinessCheckTime: 1419.1ms, AutomataDifference: 70982.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5026.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11798 SDtfs, 19785 SDslu, 107017 SDs, 0 SdLazy, 49672 SolverSat, 2598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23850.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 107 SyntacticMatches, 135 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9530 ImplicationChecksByTransitivity, 33026.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 1108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 55039.8ms AutomataMinimizationTime, 50 MinimizatonAttempts, 329053 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 74.8ms SsaConstructionTime, 599.6ms SatisfiabilityAnalysisTime, 18388.6ms InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3279 ConstructedInterpolants, 0 QuantifiedInterpolants, 73527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 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...